./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncmp_mixed_alloca_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-15/cstrncmp_mixed_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 d636ecd38a9bab1e233be153b35a44e893aa6784 .................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:46:54,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:46:54,339 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:46:54,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:46:54,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:46:54,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:46:54,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:46:54,362 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:46:54,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:46:54,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:46:54,365 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:46:54,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:46:54,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:46:54,368 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:46:54,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:46:54,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:46:54,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:46:54,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:46:54,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:46:54,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:46:54,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:46:54,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:46:54,383 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:46:54,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:46:54,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:46:54,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:46:54,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:46:54,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:46:54,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:46:54,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:46:54,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:46:54,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:46:54,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:46:54,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:46:54,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:46:54,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:46:54,393 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:46:54,422 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:46:54,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:46:54,423 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:46:54,423 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:46:54,424 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:46:54,424 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:46:54,424 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:46:54,424 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:46:54,424 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:46:54,424 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:46:54,425 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:46:54,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:46:54,425 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:46:54,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:46:54,425 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:46:54,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:46:54,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:46:54,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:46:54,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:46:54,426 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:46:54,426 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:46:54,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:46:54,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:46:54,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:46:54,427 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:46:54,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:46:54,427 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:46:54,428 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:46:54,429 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:46:54,429 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 -> d636ecd38a9bab1e233be153b35a44e893aa6784 [2019-01-14 02:46:54,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:46:54,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:46:54,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:46:54,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:46:54,491 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:46:54,492 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncmp_mixed_alloca_true-termination.c.i [2019-01-14 02:46:54,562 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13fc9a08/d3066b230ae44379a28e6cea757ba04f/FLAGc6a3b7a4f [2019-01-14 02:46:55,071 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:46:55,072 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncmp_mixed_alloca_true-termination.c.i [2019-01-14 02:46:55,084 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13fc9a08/d3066b230ae44379a28e6cea757ba04f/FLAGc6a3b7a4f [2019-01-14 02:46:55,343 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13fc9a08/d3066b230ae44379a28e6cea757ba04f [2019-01-14 02:46:55,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:46:55,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:46:55,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:46:55,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:46:55,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:46:55,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:46:55" (1/1) ... [2019-01-14 02:46:55,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1a718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:55, skipping insertion in model container [2019-01-14 02:46:55,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:46:55" (1/1) ... [2019-01-14 02:46:55,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:46:55,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:46:55,784 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:46:55,796 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:46:55,941 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:46:56,023 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:46:56,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56 WrapperNode [2019-01-14 02:46:56,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:46:56,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:46:56,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:46:56,025 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:46:56,036 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:46:56" (1/1) ... [2019-01-14 02:46:56,054 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:46:56" (1/1) ... [2019-01-14 02:46:56,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:46:56,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:46:56,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:46:56,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:46:56,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (1/1) ... [2019-01-14 02:46:56,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (1/1) ... [2019-01-14 02:46:56,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (1/1) ... [2019-01-14 02:46:56,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (1/1) ... [2019-01-14 02:46:56,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (1/1) ... [2019-01-14 02:46:56,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (1/1) ... [2019-01-14 02:46:56,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (1/1) ... [2019-01-14 02:46:56,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:46:56,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:46:56,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:46:56,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:46:56,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (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:46:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:46:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:46:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:46:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:46:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:46:56,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:46:56,606 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:46:56,607 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:46:56,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:56 BoogieIcfgContainer [2019-01-14 02:46:56,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:46:56,609 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:46:56,609 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:46:56,612 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:46:56,613 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:56,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:46:55" (1/3) ... [2019-01-14 02:46:56,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4711ebcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:46:56, skipping insertion in model container [2019-01-14 02:46:56,615 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:56,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:56" (2/3) ... [2019-01-14 02:46:56,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4711ebcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:46:56, skipping insertion in model container [2019-01-14 02:46:56,616 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:56,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:56" (3/3) ... [2019-01-14 02:46:56,618 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp_mixed_alloca_true-termination.c.i [2019-01-14 02:46:56,685 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:46:56,686 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:46:56,686 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:46:56,686 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:46:56,687 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:46:56,687 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:46:56,687 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:46:56,687 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:46:56,687 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:46:56,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:46:56,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:46:56,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:56,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:56,739 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:56,739 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:56,739 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:46:56,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:46:56,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:46:56,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:56,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:56,742 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:56,742 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:56,751 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 20#L367true assume !(0 == cstrncmp_~n); 6#L369-5true [2019-01-14 02:46:56,752 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-5true cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 17#L369-1true assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 4#L369-3true assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~post205;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 14#L370true assume cstrncmp_#t~short210; 19#L370-2true assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset - 1;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 6#L369-5true [2019-01-14 02:46:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:56,761 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-01-14 02:46:56,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:56,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:56,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2019-01-14 02:46:56,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:56,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:56,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:57,024 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:46:57,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:46:57,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:46:57,031 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:46:57,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:46:57,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:46:57,052 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-01-14 02:46:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:46:57,156 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-01-14 02:46:57,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:46:57,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-14 02:46:57,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:46:57,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2019-01-14 02:46:57,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:46:57,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:46:57,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 02:46:57,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:46:57,170 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:46:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 02:46:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:46:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:46:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-14 02:46:57,205 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:46:57,205 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:46:57,205 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:46:57,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-14 02:46:57,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:46:57,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:57,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:57,208 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:57,208 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:57,208 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#L-1 havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 47#L382 assume !(main_~length1~0 < 1); 50#L382-2 assume !(main_~length2~0 < 1); 55#L385-1 call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 56#L367 assume !(0 == cstrncmp_~n); 53#L369-5 [2019-01-14 02:46:57,209 INFO L796 eck$LassoCheckResult]: Loop: 53#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 54#L369-1 assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 48#L369-3 assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~post205;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 49#L370 assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 0 == cstrncmp_#t~mem209; 52#L370-2 assume !cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;havoc cstrncmp_#t~short210;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset - 1;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 53#L369-5 [2019-01-14 02:46:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:57,209 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2019-01-14 02:46:57,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:57,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:57,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:57,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2019-01-14 02:46:57,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:57,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:46:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:57,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2019-01-14 02:46:57,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:57,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:57,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:57,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:58,414 WARN L181 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-01-14 02:46:59,267 WARN L181 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-01-14 02:46:59,456 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-14 02:46:59,467 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:46:59,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:46:59,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:46:59,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:46:59,469 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:46:59,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:46:59,470 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:46:59,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:46:59,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:46:59,470 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:46:59,471 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:46:59,501 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:46:59,521 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:46:59,523 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:46:59,548 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:46:59,551 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:46:59,559 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:46:59,582 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:46:59,585 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:46:59,588 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:46:59,592 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:46:59,594 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:46:59,596 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:46:59,599 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:46:59,602 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:46:59,617 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:46:59,638 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:46:59,641 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:46:59,643 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:46:59,646 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:47:00,045 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-01-14 02:47:00,240 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-14 02:47:00,241 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:47:00,243 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:47:00,245 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:47:00,247 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:47:00,250 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:47:00,519 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 02:47:01,445 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-14 02:47:01,581 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:01,587 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:01,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:01,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:01,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:01,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:01,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:01,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:01,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:01,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:01,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:01,596 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:47:01,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:01,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:01,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:01,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:01,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:01,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:01,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:01,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:01,600 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:47:01,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:01,600 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:47:01,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:01,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:01,605 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:47:01,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:01,652 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:01,679 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:47:01,679 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:47:01,682 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:01,685 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:01,686 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:01,687 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n) = 1*ULTIMATE.start_cstrncmp_~n Supporting invariants [] [2019-01-14 02:47:01,837 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 02:47:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:01,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:01,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:02,168 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:47:02,172 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:47:02,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-14 02:47:02,227 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 6 states. [2019-01-14 02:47:02,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:47:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 02:47:02,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-14 02:47:02,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:02,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-14 02:47:02,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:02,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2019-01-14 02:47:02,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:02,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-01-14 02:47:02,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:47:02,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-14 02:47:02,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:47:02,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:47:02,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:47:02,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:02,236 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:02,237 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:02,237 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:02,237 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:47:02,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:47:02,237 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:47:02,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:47:02,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:47:02 BoogieIcfgContainer [2019-01-14 02:47:02,244 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:47:02,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:47:02,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:47:02,245 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:47:02,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:56" (3/4) ... [2019-01-14 02:47:02,249 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:47:02,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:47:02,250 INFO L168 Benchmark]: Toolchain (without parser) took 6903.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:02,252 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:47:02,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:02,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.91 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:47:02,254 INFO L168 Benchmark]: Boogie Preprocessor took 47.87 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:47:02,254 INFO L168 Benchmark]: RCFGBuilder took 466.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:02,255 INFO L168 Benchmark]: BuchiAutomizer took 5634.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:02,256 INFO L168 Benchmark]: Witness Printer took 5.08 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:47:02,261 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 675.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.91 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 47.87 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 466.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5634.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 12 SDslu, 23 SDs, 0 SdLazy, 15 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital236 mio100 ax100 hnf99 lsp88 ukn86 mio100 lsp44 div100 bol100 ite100 ukn100 eq189 hnf89 smp100 dnf173 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 86ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...