./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/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-0ed9222-m [2019-01-14 02:25:07,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:25:07,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:25:07,275 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:25:07,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:25:07,276 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:25:07,278 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:25:07,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:25:07,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:25:07,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:25:07,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:25:07,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:25:07,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:25:07,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:25:07,287 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:25:07,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:25:07,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:25:07,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:25:07,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:25:07,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:25:07,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:25:07,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:25:07,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:25:07,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:25:07,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:25:07,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:25:07,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:25:07,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:25:07,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:25:07,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:25:07,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:25:07,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:25:07,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:25:07,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:25:07,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:25:07,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:25:07,312 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:25:07,330 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:25:07,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:25:07,331 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:25:07,331 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:25:07,332 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:25:07,332 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:25:07,333 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:25:07,333 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:25:07,333 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:25:07,333 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:25:07,333 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:25:07,334 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:25:07,334 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:25:07,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:25:07,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:25:07,334 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:25:07,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:25:07,336 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:25:07,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:25:07,336 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:25:07,336 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:25:07,337 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:25:07,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:25:07,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:25:07,337 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:25:07,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:25:07,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:25:07,339 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:25:07,340 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:25:07,340 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 [2019-01-14 02:25:07,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:25:07,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:25:07,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:25:07,391 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:25:07,391 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:25:07,392 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strrchr_true-termination.c.i [2019-01-14 02:25:07,447 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ed8a4f9/610f4ab9aa7441ff98fe9f5c81a5b5fc/FLAG247136cec [2019-01-14 02:25:07,972 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:25:07,973 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strrchr_true-termination.c.i [2019-01-14 02:25:07,992 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ed8a4f9/610f4ab9aa7441ff98fe9f5c81a5b5fc/FLAG247136cec [2019-01-14 02:25:08,233 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ed8a4f9/610f4ab9aa7441ff98fe9f5c81a5b5fc [2019-01-14 02:25:08,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:25:08,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:25:08,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:25:08,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:25:08,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:25:08,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a2acbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08, skipping insertion in model container [2019-01-14 02:25:08,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:25:08,303 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:25:08,709 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:25:08,726 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:25:08,853 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:25:08,909 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:25:08,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08 WrapperNode [2019-01-14 02:25:08,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:25:08,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:25:08,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:25:08,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:25:08,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:25:08,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:25:08,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:25:08,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:25:08,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:08,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... [2019-01-14 02:25:09,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:25:09,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:25:09,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:25:09,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:25:09,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:09,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:25:09,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:25:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:25:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:25:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:25:09,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:25:09,527 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:25:09,527 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:25:09,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:09 BoogieIcfgContainer [2019-01-14 02:25:09,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:25:09,529 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:25:09,530 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:25:09,532 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:25:09,533 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:09,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:25:08" (1/3) ... [2019-01-14 02:25:09,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a2f4b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:25:09, skipping insertion in model container [2019-01-14 02:25:09,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:09,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:08" (2/3) ... [2019-01-14 02:25:09,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a2f4b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:25:09, skipping insertion in model container [2019-01-14 02:25:09,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:09,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:09" (3/3) ... [2019-01-14 02:25:09,537 INFO L375 chiAutomizerObserver]: Analyzing ICFG strrchr_true-termination.c.i [2019-01-14 02:25:09,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:25:09,586 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:25:09,586 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:25:09,586 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:25:09,586 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:25:09,586 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:25:09,586 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:25:09,587 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:25:09,587 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:25:09,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:25:09,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-14 02:25:09,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:09,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:09,634 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:25:09,634 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:09,635 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:25:09,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:25:09,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-14 02:25:09,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:09,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:09,638 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:25:09,638 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:09,646 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.allocOnStack(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 [2019-01-14 02:25:09,647 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 [2019-01-14 02:25:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:09,653 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:25:09,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:09,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:09,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:09,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:09,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:09,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1555843192, now seen corresponding path program 1 times [2019-01-14 02:25:09,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:09,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:09,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:09,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash -220781627, now seen corresponding path program 1 times [2019-01-14 02:25:09,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:09,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:09,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:10,840 WARN L181 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-01-14 02:25:11,150 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:25:11,581 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-01-14 02:25:11,890 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 02:25:11,908 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:25:11,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:25:11,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:25:11,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:25:11,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:25:11,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:11,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:25:11,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:25:11,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: strrchr_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:25:11,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:25:11,911 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:25:11,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:11,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,558 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-01-14 02:25:12,776 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-14 02:25:12,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:12,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-14 02:25:13,470 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 02:25:13,670 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 02:25:14,161 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 02:25:14,273 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:25:14,278 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:25:14,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:14,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:14,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:14,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:14,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:14,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:14,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:14,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:14,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:14,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:14,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:14,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:14,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:14,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:14,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:14,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:14,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:14,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:14,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:14,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:14,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:14,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:14,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:14,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:14,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:14,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:14,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:14,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:14,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:14,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:14,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:14,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:14,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:14,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:14,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,352 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:25:14,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:14,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,365 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:25:14,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:14,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:14,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,413 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:25:14,413 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 02:25:14,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,473 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-14 02:25:14,474 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-14 02:25:14,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:14,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:14,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:14,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:14,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:14,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:14,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:14,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:14,800 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:25:14,845 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:25:14,848 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:25:14,851 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:25:14,854 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:25:14,854 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:25:14,855 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strrchr_~t.base)_1, ULTIMATE.start_strrchr_~l~0.offset) = 1*v_rep(select #length ULTIMATE.start_strrchr_~t.base)_1 - 1*ULTIMATE.start_strrchr_~l~0.offset Supporting invariants [1*ULTIMATE.start_strrchr_~t.offset - 1*ULTIMATE.start_strrchr_~l~0.offset >= 0] [2019-01-14 02:25:15,154 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-01-14 02:25:15,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:25:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:15,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:15,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:25:15,638 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-14 02:25:15,639 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 7 states. [2019-01-14 02:25:16,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 7 states. Result 129 states and 181 transitions. Complement of second has 11 states. [2019-01-14 02:25:16,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:25:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:25:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2019-01-14 02:25:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 100 transitions. Stem has 3 letters. Loop has 13 letters. [2019-01-14 02:25:16,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:16,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 100 transitions. Stem has 16 letters. Loop has 13 letters. [2019-01-14 02:25:16,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:16,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 100 transitions. Stem has 3 letters. Loop has 26 letters. [2019-01-14 02:25:16,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:16,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 181 transitions. [2019-01-14 02:25:16,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-14 02:25:16,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 89 states and 114 transitions. [2019-01-14 02:25:16,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-14 02:25:16,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-14 02:25:16,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 114 transitions. [2019-01-14 02:25:16,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:25:16,131 INFO L706 BuchiCegarLoop]: Abstraction has 89 states and 114 transitions. [2019-01-14 02:25:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 114 transitions. [2019-01-14 02:25:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2019-01-14 02:25:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 02:25:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2019-01-14 02:25:16,159 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 92 transitions. [2019-01-14 02:25:16,159 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 92 transitions. [2019-01-14 02:25:16,159 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:25:16,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 92 transitions. [2019-01-14 02:25:16,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-14 02:25:16,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:16,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:16,162 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:16,162 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:16,163 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 310#L-1 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; 311#L520 assume !(main_~in_len~0 < 1);call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(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); 316#L510-2 assume !false;call strrchr_#t~mem2 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 340#L511 assume !(strrchr_#t~mem2 == strrchr_~ch~0);havoc strrchr_#t~mem2; 338#L511-2 call strrchr_#t~mem3 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 336#L511-3 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); 334#L512 assume strrchr_#t~mem5 == strrchr_~ch~0;havoc strrchr_#t~mem5;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 331#L512-2 call strrchr_#t~mem6 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 332#L512-3 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); 327#L513 assume !(strrchr_#t~mem8 == strrchr_~ch~0);havoc strrchr_#t~mem8; 292#L513-2 [2019-01-14 02:25:16,163 INFO L796 eck$LassoCheckResult]: Loop: 292#L513-2 call strrchr_#t~mem9 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 355#L513-3 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); 287#L514 assume !(strrchr_#t~mem11 == strrchr_~ch~0);havoc strrchr_#t~mem11; 288#L514-2 call strrchr_#t~mem12 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 295#L514-3 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; 308#L510-2 assume !false;call strrchr_#t~mem2 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 304#L511 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; 305#L511-2 call strrchr_#t~mem3 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 354#L511-3 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); 297#L512 assume !(strrchr_#t~mem5 == strrchr_~ch~0);havoc strrchr_#t~mem5; 298#L512-2 call strrchr_#t~mem6 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 313#L512-3 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); 291#L513 assume !(strrchr_#t~mem8 == strrchr_~ch~0);havoc strrchr_#t~mem8; 292#L513-2 [2019-01-14 02:25:16,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:16,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1567036087, now seen corresponding path program 1 times [2019-01-14 02:25:16,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:16,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:16,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1564022906, now seen corresponding path program 1 times [2019-01-14 02:25:16,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:16,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:16,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:16,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1332056944, now seen corresponding path program 1 times [2019-01-14 02:25:16,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:16,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:16,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:16,548 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-01-14 02:25:17,096 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2019-01-14 02:25:17,721 WARN L181 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-01-14 02:25:17,726 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:25:17,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:25:17,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:25:17,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:25:17,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:25:17,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:17,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:25:17,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:25:17,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: strrchr_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:25:17,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:25:17,727 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:25:17,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:17,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,162 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:25:18,643 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-01-14 02:25:18,810 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-14 02:25:18,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:18,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:19,073 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-14 02:25:19,222 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:25:19,227 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-14 02:25:21,565 WARN L181 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2019-01-14 02:25:26,922 WARN L181 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2019-01-14 02:25:27,106 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:25:27,109 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:25:27,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:27,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:27,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:27,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:27,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:27,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:27,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:27,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:27,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:27,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:27,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:27,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:27,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:27,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:27,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:27,226 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-14 02:25:27,226 INFO L206 nArgumentSynthesizer]: 72 loop disjuncts [2019-01-14 02:25:27,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:31,884 INFO L402 nArgumentSynthesizer]: We have 12240 Motzkin's Theorem applications. [2019-01-14 02:25:31,884 INFO L403 nArgumentSynthesizer]: A total of 144 supporting invariants were added. [2019-01-14 02:25:59,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:59,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:59,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:59,933 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:25:59,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:59,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:59,934 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:25:59,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:59,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:59,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:59,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:59,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:59,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:59,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:59,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:59,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:59,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:59,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:59,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:59,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:59,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:59,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:59,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:59,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:59,967 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:00,005 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:26:00,010 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:26:00,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:00,011 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:00,011 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:00,011 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_2, ULTIMATE.start_strrchr_~t.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_2 - 1*ULTIMATE.start_strrchr_~t.offset Supporting invariants [] [2019-01-14 02:26:00,136 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2019-01-14 02:26:00,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:26:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:00,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:00,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:00,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:26:00,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 92 transitions. cyclomatic complexity: 25 Second operand 8 states. [2019-01-14 02:26:00,489 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 92 transitions. cyclomatic complexity: 25. Second operand 8 states. Result 162 states and 219 transitions. Complement of second has 7 states. [2019-01-14 02:26:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:26:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2019-01-14 02:26:00,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 11 letters. Loop has 13 letters. [2019-01-14 02:26:00,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:00,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 24 letters. Loop has 13 letters. [2019-01-14 02:26:00,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:00,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 11 letters. Loop has 26 letters. [2019-01-14 02:26:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:00,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 219 transitions. [2019-01-14 02:26:00,503 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:26:00,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 0 states and 0 transitions. [2019-01-14 02:26:00,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:26:00,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:26:00,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:26:00,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:26:00,504 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:00,504 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:00,504 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:00,504 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:26:00,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:26:00,504 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:26:00,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:26:00,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:26:00 BoogieIcfgContainer [2019-01-14 02:26:00,512 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:26:00,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:26:00,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:26:00,512 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:26:00,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:09" (3/4) ... [2019-01-14 02:26:00,516 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:26:00,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:26:00,517 INFO L168 Benchmark]: Toolchain (without parser) took 52279.90 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 951.3 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 991.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:00,518 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-14 02:26:00,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:00,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:00,521 INFO L168 Benchmark]: Boogie Preprocessor took 30.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:00,522 INFO L168 Benchmark]: RCFGBuilder took 528.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:00,523 INFO L168 Benchmark]: BuchiAutomizer took 50982.41 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 994.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:00,525 INFO L168 Benchmark]: Witness Printer took 3.82 ms. Allocated memory is still 4.0 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:00,530 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 671.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 528.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50982.41 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 994.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.82 ms. Allocated memory is still 4.0 GB. Free memory is still 2.9 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 - 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[t] + -1 * l and consists of 7 locations. 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 50.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 49.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 38 SDtfs, 124 SDslu, 52 SDs, 0 SdLazy, 181 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital338 mio100 ax100 hnf99 lsp76 ukn96 mio100 lsp40 div124 bol100 ite100 ukn100 eq171 hnf79 smp78 dnf3074 smp44 tf100 neg91 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32702ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 12 DisjunctsLoop: 72 SupportingInvariants: 144 MotzkinApplications: 12240 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...