./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cmemchr-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cmemchr-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 41c98898a531fb0ee2da225b716afd5dc80c24b1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:51:34,218 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:51:34,220 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:51:34,232 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:51:34,232 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:51:34,233 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:51:34,234 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:51:34,236 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:51:34,238 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:51:34,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:51:34,239 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:51:34,240 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:51:34,241 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:51:34,242 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:51:34,243 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:51:34,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:51:34,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:51:34,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:51:34,248 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:51:34,250 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:51:34,251 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:51:34,252 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:51:34,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:51:34,255 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:51:34,256 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:51:34,257 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:51:34,258 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:51:34,258 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:51:34,259 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:51:34,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:51:34,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:51:34,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:51:34,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:51:34,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:51:34,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:51:34,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:51:34,264 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:51:34,295 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:51:34,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:51:34,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:51:34,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:51:34,297 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:51:34,297 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:51:34,297 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:51:34,298 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:51:34,298 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:51:34,298 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:51:34,298 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:51:34,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:51:34,299 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:51:34,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:51:34,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:51:34,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:51:34,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:51:34,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:51:34,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:51:34,300 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:51:34,300 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:51:34,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:51:34,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:51:34,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:51:34,301 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:51:34,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:51:34,301 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:51:34,301 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:51:34,302 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:51:34,302 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 -> 41c98898a531fb0ee2da225b716afd5dc80c24b1 [2019-01-01 21:51:34,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:51:34,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:51:34,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:51:34,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:51:34,366 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:51:34,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cmemchr-alloca_true-termination.c.i [2019-01-01 21:51:34,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80264dc8e/8ac00c5180114c7b87a877f9da36d2f4/FLAG5e7f66120 [2019-01-01 21:51:34,984 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:51:34,985 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cmemchr-alloca_true-termination.c.i [2019-01-01 21:51:35,001 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80264dc8e/8ac00c5180114c7b87a877f9da36d2f4/FLAG5e7f66120 [2019-01-01 21:51:35,215 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80264dc8e/8ac00c5180114c7b87a877f9da36d2f4 [2019-01-01 21:51:35,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:51:35,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:51:35,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:51:35,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:51:35,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:51:35,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79041f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35, skipping insertion in model container [2019-01-01 21:51:35,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:51:35,298 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:51:35,685 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:51:35,703 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:51:35,837 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:51:35,903 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:51:35,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35 WrapperNode [2019-01-01 21:51:35,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:51:35,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:51:35,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:51:35,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:51:35,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:51:35,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:51:35,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:51:35,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:51:35,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... [2019-01-01 21:51:35,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:51:35,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:51:35,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:51:35,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:51:35,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:51:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:51:36,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:51:36,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:51:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:51:36,532 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:51:36,533 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:51:36,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:51:36 BoogieIcfgContainer [2019-01-01 21:51:36,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:51:36,534 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:51:36,534 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:51:36,538 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:51:36,538 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:51:36,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:51:35" (1/3) ... [2019-01-01 21:51:36,540 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ccb20b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:51:36, skipping insertion in model container [2019-01-01 21:51:36,540 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:51:36,540 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:35" (2/3) ... [2019-01-01 21:51:36,541 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ccb20b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:51:36, skipping insertion in model container [2019-01-01 21:51:36,541 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:51:36,541 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:51:36" (3/3) ... [2019-01-01 21:51:36,543 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cmemchr-alloca_true-termination.c.i [2019-01-01 21:51:36,600 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:51:36,600 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:51:36,601 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:51:36,601 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:51:36,601 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:51:36,601 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:51:36,601 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:51:36,601 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:51:36,602 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:51:36,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 21:51:36,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:51:36,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:36,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:36,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:51:36,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:51:36,644 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:51:36,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 21:51:36,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:51:36,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:36,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:36,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:51:36,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:51:36,654 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9.base, main_#t~ret9.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 9#L563true assume !(main_~length~0 < 1); 12#L563-2true assume !(main_~n~0 < 1); 5#L566-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; 13#L550true assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; 3#L552-4true [2019-01-01 21:51:36,655 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true cmemchr_#t~post3.base, cmemchr_#t~post3.offset := cmemchr_~p~0.base, cmemchr_~p~0.offset;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_#t~post3.base, 1 + cmemchr_#t~post3.offset;call cmemchr_#t~mem4 := read~int(cmemchr_#t~post3.base, cmemchr_#t~post3.offset, 1); 7#L553true assume !(cmemchr_#t~mem4 % 256 == cmemchr_~c % 256);havoc cmemchr_#t~mem4;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset; 10#L552-1true cmemchr_#t~pre2 := cmemchr_~n - 1;cmemchr_~n := cmemchr_~n - 1; 14#L552-2true assume !!(0 != cmemchr_#t~pre2 % 4294967296);havoc cmemchr_#t~pre2; 3#L552-4true [2019-01-01 21:51:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:36,661 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2019-01-01 21:51:36,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:36,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:36,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1605803, now seen corresponding path program 1 times [2019-01-01 21:51:36,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:36,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:36,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1592233654, now seen corresponding path program 1 times [2019-01-01 21:51:36,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:36,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:36,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:37,167 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-01 21:51:37,485 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-01 21:51:37,747 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 21:51:37,770 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:51:37,771 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:51:37,771 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:51:37,771 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:51:37,772 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:51:37,772 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:37,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:51:37,772 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:51:37,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cmemchr-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:51:37,773 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:51:37,773 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:51:37,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:37,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:38,640 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-01-01 21:51:38,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:38,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:38,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:38,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:38,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-01 21:51:38,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:38,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-01 21:51:39,315 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-01-01 21:51:39,671 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2019-01-01 21:51:39,819 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 21:51:39,985 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:51:39,991 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:51:39,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:39,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:39,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:39,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:39,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:39,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:40,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:40,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:40,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:40,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:40,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:40,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:40,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:40,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:40,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:40,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:40,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:40,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:40,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:40,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:40,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:40,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:40,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:40,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:40,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:40,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:40,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:40,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:40,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:40,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:40,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:40,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:40,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:40,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:40,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,087 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:51:40,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,101 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 21:51:40,101 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:51:40,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,201 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:51:40,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,207 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:51:40,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:40,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:40,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:40,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:40,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:40,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:40,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:40,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:40,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:40,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:40,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:40,346 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:51:40,397 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:51:40,397 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:51:40,400 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:51:40,404 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:51:40,404 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:51:40,405 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cmemchr_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cmemchr_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2019-01-01 21:51:40,488 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:51:40,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:51:40,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:40,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:40,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:41,049 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:51:41,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-01-01 21:51:41,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 37 transitions. Complement of second has 7 states. [2019-01-01 21:51:41,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:51:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-01 21:51:41,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:51:41,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:41,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:51:41,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:41,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:51:41,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:41,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-01-01 21:51:41,201 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:51:41,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-01 21:51:41,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:51:41,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:51:41,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:51:41,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:51:41,206 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:51:41,206 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:51:41,206 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:51:41,206 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:51:41,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:51:41,207 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:51:41,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:51:41,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:51:41 BoogieIcfgContainer [2019-01-01 21:51:41,214 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:51:41,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:51:41,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:51:41,215 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:51:41,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:51:36" (3/4) ... [2019-01-01 21:51:41,220 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:51:41,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:51:41,221 INFO L168 Benchmark]: Toolchain (without parser) took 6001.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.7 MB in the beginning and 829.6 MB in the end (delta: 123.1 MB). Peak memory consumption was 255.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:41,222 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:51:41,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:41,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:51:41,224 INFO L168 Benchmark]: Boogie Preprocessor took 29.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:51:41,225 INFO L168 Benchmark]: RCFGBuilder took 550.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:41,226 INFO L168 Benchmark]: BuchiAutomizer took 4679.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 829.6 MB in the end (delta: 258.7 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:41,227 INFO L168 Benchmark]: Witness Printer took 5.68 ms. Allocated memory is still 1.2 GB. Free memory is still 829.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:51:41,231 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 683.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.07 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 29.10 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 550.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4679.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 829.6 MB in the end (delta: 258.7 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.68 ms. Allocated memory is still 1.2 GB. Free memory is still 829.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * p + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 16 SDtfs, 16 SDslu, 12 SDs, 0 SdLazy, 10 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax112 hnf98 lsp82 ukn99 mio100 lsp55 div214 bol100 ite100 ukn100 eq166 hnf63 smp91 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 108ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...