./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strrchr_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/strrchr_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 900f92af74c0348435977f69b7ec984c63076a1b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:18:11,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:11,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:11,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:11,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:11,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:11,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:11,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:11,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:11,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:11,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:11,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:11,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:11,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:11,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:11,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:11,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:11,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:11,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:11,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:11,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:11,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:11,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:11,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:11,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:11,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:11,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:11,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:11,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:11,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:11,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:11,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:11,616 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:11,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:11,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:11,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:11,618 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:11,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:11,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:11,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:11,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:11,643 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:11,643 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:11,643 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:11,643 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:11,643 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:11,644 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:11,645 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:11,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:11,645 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:11,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:11,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:11,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:11,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:11,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:11,648 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:11,648 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:11,648 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:11,648 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:11,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:11,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:11,649 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:11,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:11,649 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:11,650 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:11,654 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:11,654 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 -> 900f92af74c0348435977f69b7ec984c63076a1b [2018-11-28 23:18:11,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:11,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:11,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:11,744 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:11,744 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:11,745 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strrchr_true-termination.c.i [2018-11-28 23:18:11,811 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d40c581/97f69f9148774f48952760298c7f58f6/FLAG5a4bb5dc4 [2018-11-28 23:18:12,323 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:12,327 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strrchr_true-termination.c.i [2018-11-28 23:18:12,345 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d40c581/97f69f9148774f48952760298c7f58f6/FLAG5a4bb5dc4 [2018-11-28 23:18:12,621 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d40c581/97f69f9148774f48952760298c7f58f6 [2018-11-28 23:18:12,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:12,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:12,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:12,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:12,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:12,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:12" (1/1) ... [2018-11-28 23:18:12,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5503ad97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:12, skipping insertion in model container [2018-11-28 23:18:12,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:12" (1/1) ... [2018-11-28 23:18:12,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:12,693 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:13,088 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:13,105 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:13,186 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:13,370 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:13,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13 WrapperNode [2018-11-28 23:18:13,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:13,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:13,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:13,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:13,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:13,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:13,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:13,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:13,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (1/1) ... [2018-11-28 23:18:13,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:13,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:13,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:13,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:13,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (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 [2018-11-28 23:18:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:13,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:14,080 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:14,081 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:18:14,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:14 BoogieIcfgContainer [2018-11-28 23:18:14,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:14,082 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:14,083 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:14,086 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:14,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:14,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:12" (1/3) ... [2018-11-28 23:18:14,088 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27bc3ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:14, skipping insertion in model container [2018-11-28 23:18:14,088 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:14,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:13" (2/3) ... [2018-11-28 23:18:14,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27bc3ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:14, skipping insertion in model container [2018-11-28 23:18:14,090 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:14,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:14" (3/3) ... [2018-11-28 23:18:14,091 INFO L375 chiAutomizerObserver]: Analyzing ICFG strrchr_true-termination.c.i [2018-11-28 23:18:14,158 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:14,159 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:14,159 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:14,159 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:14,159 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:14,159 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:14,159 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:14,160 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:14,160 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:14,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 23:18:14,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 23:18:14,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:14,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:14,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:14,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:14,213 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:14,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 23:18:14,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 23:18:14,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:14,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:14,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:14,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:14,224 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~ret17.base, main_#t~ret17.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~the_int~0;main_~in_len~0 := main_#t~nondet14;havoc main_#t~nondet14; 16#L520true assume !(main_~in_len~0 < 1);call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~the_int~0 := main_#t~nondet16;havoc main_#t~nondet16;strrchr_#in~t.base, strrchr_#in~t.offset, strrchr_#in~c := main_~in~0.base, main_~in~0.offset, main_~the_int~0;havoc strrchr_#res.base, strrchr_#res.offset;havoc strrchr_#t~mem2, strrchr_#t~mem3, strrchr_#t~pre4.base, strrchr_#t~pre4.offset, strrchr_#t~mem5, strrchr_#t~mem6, strrchr_#t~pre7.base, strrchr_#t~pre7.offset, strrchr_#t~mem8, strrchr_#t~mem9, strrchr_#t~pre10.base, strrchr_#t~pre10.offset, strrchr_#t~mem11, strrchr_#t~mem12, strrchr_#t~pre13.base, strrchr_#t~pre13.offset, strrchr_~t.base, strrchr_~t.offset, strrchr_~c, strrchr_~ch~0, strrchr_~l~0.base, strrchr_~l~0.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_#in~t.base, strrchr_#in~t.offset;strrchr_~c := strrchr_#in~c;havoc strrchr_~ch~0;strrchr_~l~0.base, strrchr_~l~0.offset := 0, 0;strrchr_~ch~0 := (if strrchr_~c % 256 <= 127 then strrchr_~c % 256 else strrchr_~c % 256 - 256); 19#L510-2true [2018-11-28 23:18:14,225 INFO L796 eck$LassoCheckResult]: Loop: 19#L510-2true assume !false;call strrchr_#t~mem2 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 9#L511true assume strrchr_#t~mem2 == strrchr_~ch~0;havoc strrchr_#t~mem2;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 17#L511-2true call strrchr_#t~mem3 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 21#L511-3true assume !(0 == strrchr_#t~mem3);havoc strrchr_#t~mem3;strrchr_#t~pre4.base, strrchr_#t~pre4.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre4.base, strrchr_#t~pre4.offset;call strrchr_#t~mem5 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 7#L512true assume !(strrchr_#t~mem5 == strrchr_~ch~0);havoc strrchr_#t~mem5; 13#L512-2true call strrchr_#t~mem6 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 18#L512-3true assume !(0 == strrchr_#t~mem6);havoc strrchr_#t~mem6;strrchr_#t~pre7.base, strrchr_#t~pre7.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre7.base, strrchr_#t~pre7.offset;call strrchr_#t~mem8 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 6#L513true assume strrchr_#t~mem8 == strrchr_~ch~0;havoc strrchr_#t~mem8;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 10#L513-2true call strrchr_#t~mem9 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 14#L513-3true assume !(0 == strrchr_#t~mem9);havoc strrchr_#t~mem9;strrchr_#t~pre10.base, strrchr_#t~pre10.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre10.base, strrchr_#t~pre10.offset;call strrchr_#t~mem11 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 4#L514true assume strrchr_#t~mem11 == strrchr_~ch~0;havoc strrchr_#t~mem11;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 8#L514-2true call strrchr_#t~mem12 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 11#L514-3true assume !(0 == strrchr_#t~mem12);havoc strrchr_#t~mem12;strrchr_#t~pre13.base, strrchr_#t~pre13.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre13.base, strrchr_#t~pre13.offset; 19#L510-2true [2018-11-28 23:18:14,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:18:14,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1555843192, now seen corresponding path program 1 times [2018-11-28 23:18:14,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:14,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash -220781627, now seen corresponding path program 1 times [2018-11-28 23:18:14,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:14,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:15,405 WARN L180 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2018-11-28 23:18:15,757 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 23:18:15,950 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-11-28 23:18:16,241 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-28 23:18:16,266 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:16,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:16,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:16,267 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:16,268 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:16,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:16,268 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:16,268 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:16,268 INFO L131 ssoRankerPreferences]: Filename of dumped script: strrchr_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:18:16,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:16,270 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:16,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:17,030 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-11-28 23:18:17,288 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-28 23:18:17,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:17,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:17,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:17,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:17,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:17,903 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:18:18,085 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-28 23:18:18,478 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-28 23:18:18,558 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:18,564 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:18,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:18,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:18,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:18,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:18,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:18,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:18,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:18,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,688 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:18,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,695 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:18,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:18,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:18,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:18,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:18,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:18,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:18,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:18,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:18,775 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:18,775 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 23:18:18,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:18,856 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-28 23:18:18,857 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 23:18:19,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:19,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:19,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:19,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:19,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:19,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:19,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:19,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:19,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:19,233 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:18:19,233 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:18:19,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:19,239 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:19,239 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:19,240 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_1, ULTIMATE.start_strrchr_~t.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_1 - 1*ULTIMATE.start_strrchr_~t.offset Supporting invariants [] [2018-11-28 23:18:19,507 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-11-28 23:18:19,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:19,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:19,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:19,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:18:19,927 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 6 states. [2018-11-28 23:18:20,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 6 states. Result 42 states and 62 transitions. Complement of second has 8 states. [2018-11-28 23:18:20,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:18:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-28 23:18:20,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 3 letters. Loop has 13 letters. [2018-11-28 23:18:20,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:20,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 16 letters. Loop has 13 letters. [2018-11-28 23:18:20,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:20,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 3 letters. Loop has 26 letters. [2018-11-28 23:18:20,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:20,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2018-11-28 23:18:20,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:20,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-11-28 23:18:20,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:20,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:20,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:20,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:20,163 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:20,163 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:20,163 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:20,163 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:20,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:20,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:20,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:20,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:20 BoogieIcfgContainer [2018-11-28 23:18:20,170 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:20,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:20,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:20,171 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:20,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:14" (3/4) ... [2018-11-28 23:18:20,176 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:20,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:20,177 INFO L168 Benchmark]: Toolchain (without parser) took 7551.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -50.7 MB). Peak memory consumption was 131.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:20,178 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. [2018-11-28 23:18:20,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:20,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.48 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:20,182 INFO L168 Benchmark]: Boogie Preprocessor took 38.74 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. [2018-11-28 23:18:20,182 INFO L168 Benchmark]: RCFGBuilder took 602.22 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:20,183 INFO L168 Benchmark]: BuchiAutomizer took 6087.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.7 MB). Peak memory consumption was 144.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:20,184 INFO L168 Benchmark]: Witness Printer took 5.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:20,189 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 742.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.48 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.74 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 602.22 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6087.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.7 MB). Peak memory consumption was 144.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 (in_len)] + -1 * t and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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: 14 SDtfs, 22 SDslu, 24 SDs, 0 SdLazy, 48 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital283 mio100 ax100 hnf99 lsp76 ukn98 mio100 lsp36 div132 bol100 ite100 ukn100 eq166 hnf75 smp79 dnf417 smp57 tf100 neg95 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 360ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...