./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 0b29929f70f48b1f1b1180a065dc51df3698b29b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:19,682 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:19,684 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:19,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:19,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:19,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:19,699 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:19,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:19,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:19,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:19,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:19,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:19,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:19,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:19,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:19,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:19,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:19,720 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:19,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:19,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:19,725 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:19,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:19,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:19,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:19,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:19,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:19,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:19,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:19,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:19,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:19,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:19,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:19,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:19,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:19,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:19,740 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:19,740 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:19,758 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:19,758 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:19,759 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:19,760 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:19,760 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:19,760 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:19,761 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:19,761 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:19,761 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:19,761 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:19,761 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:19,761 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:19,762 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:19,762 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:19,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:19,762 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:19,762 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:19,762 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:19,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:19,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:19,764 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:19,765 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:19,765 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:19,765 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:19,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:19,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:19,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:19,767 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:19,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:19,767 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:19,767 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:19,769 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:19,769 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b29929f70f48b1f1b1180a065dc51df3698b29b [2018-11-29 00:11:19,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:19,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:19,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:19,861 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:19,861 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:19,862 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:19,930 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dcb0004/698fbe2c50d64f88a607abca0bfff956/FLAG10cbf4977 [2018-11-29 00:11:20,489 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:20,490 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:20,505 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dcb0004/698fbe2c50d64f88a607abca0bfff956/FLAG10cbf4977 [2018-11-29 00:11:20,781 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dcb0004/698fbe2c50d64f88a607abca0bfff956 [2018-11-29 00:11:20,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:20,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:20,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:20,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:20,792 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:20,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:20" (1/1) ... [2018-11-29 00:11:20,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b802d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:20, skipping insertion in model container [2018-11-29 00:11:20,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:20" (1/1) ... [2018-11-29 00:11:20,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:20,869 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:21,248 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:21,259 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:21,438 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:21,502 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:21,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21 WrapperNode [2018-11-29 00:11:21,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:21,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:21,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:21,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:21,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:21,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:21,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:21,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:21,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... [2018-11-29 00:11:21,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:21,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:21,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:21,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:21,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:21,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-29 00:11:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-29 00:11:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:22,271 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:22,271 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:11:22,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:22 BoogieIcfgContainer [2018-11-29 00:11:22,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:22,273 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:22,273 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:22,277 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:22,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:22,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:20" (1/3) ... [2018-11-29 00:11:22,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4163655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:22, skipping insertion in model container [2018-11-29 00:11:22,279 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:22,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:21" (2/3) ... [2018-11-29 00:11:22,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4163655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:22, skipping insertion in model container [2018-11-29 00:11:22,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:22,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:22" (3/3) ... [2018-11-29 00:11:22,282 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:22,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:22,343 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:22,343 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:22,343 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:22,343 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:22,343 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:22,344 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:22,344 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:22,344 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:22,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:11:22,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-29 00:11:22,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:22,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:22,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:22,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:22,404 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:22,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:11:22,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-29 00:11:22,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:22,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:22,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:22,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:22,416 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 15#L561true assume !(main_~length~0 < 1); 19#L561-2true assume !(main_~n~0 < 1); 13#L564-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;call cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.alloc(4);call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 8#L543true assume 0 != cstpncpy_~n % 4294967296;call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset;call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + (if cstpncpy_~n % 4294967296 % 4294967296 <= 2147483647 then cstpncpy_~n % 4294967296 % 4294967296 else cstpncpy_~n % 4294967296 % 4294967296 - 4294967296), cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 4);havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 9#L547-4true [2018-11-29 00:11:22,416 INFO L796 eck$LassoCheckResult]: Loop: 9#L547-4true cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, 1 + cstpncpy_#t~post5.offset;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, 1 + cstpncpy_#t~post6.offset;call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1);call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); 3#L548true assume !(0 == cstpncpy_#t~mem7);havoc cstpncpy_#t~mem7;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset;havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset; 5#L547-1true cstpncpy_#t~pre4 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 7#L547-2true assume !!(0 != cstpncpy_#t~pre4 % 4294967296);havoc cstpncpy_#t~pre4; 9#L547-4true [2018-11-29 00:11:22,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-29 00:11:22,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:22,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:22,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:22,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2018-11-29 00:11:22,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:22,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:22,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:22,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:22,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2018-11-29 00:11:22,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:22,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:22,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:23,107 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-29 00:11:23,298 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-29 00:11:24,777 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 165 DAG size of output: 153 [2018-11-29 00:11:24,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:11:25,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:11:25,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:11:25,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:11:27,345 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-29 00:11:27,655 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:11:27,660 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-29 00:11:27,917 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:11:29,061 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:11:29,322 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:11:29,327 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:11:29,611 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-29 00:11:30,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-29 00:11:30,781 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:553, output treesize:521 [2018-11-29 00:11:31,902 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 139 [2018-11-29 00:11:31,918 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:31,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:31,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:31,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:31,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:31,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:31,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:31,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:31,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-29 00:11:31,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:31,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:31,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:31,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:31,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:31,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:31,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:31,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:31,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:32,341 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-29 00:11:33,320 WARN L180 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-29 00:11:33,633 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-11-29 00:11:33,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:33,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:34,636 WARN L180 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-29 00:11:34,937 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-29 00:11:35,100 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-29 00:11:35,923 WARN L180 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-11-29 00:11:36,029 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-29 00:11:36,288 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:36,294 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:36,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:36,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:36,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:36,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:36,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:36,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:36,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:36,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:36,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:36,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:36,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:36,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:36,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:36,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:36,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:36,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:36,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:36,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:36,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:36,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:36,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:36,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:36,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:36,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:36,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:36,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:36,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:36,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:36,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:36,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:36,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:36,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:36,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:36,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:36,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:36,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:36,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:36,342 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:11:36,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,345 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:11:36,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:36,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:36,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:36,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:36,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:36,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:36,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:36,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:36,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:36,363 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:36,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:36,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:36,384 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:36,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:36,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:36,680 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:11:36,680 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:11:36,684 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:36,688 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:36,688 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:36,689 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_cstpncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-11-29 00:11:37,131 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2018-11-29 00:11:37,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:37,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:37,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:37,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-29 00:11:37,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-29 00:11:37,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:11:37,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:11:37,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:11:37,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-29 00:11:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:37,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:37,459 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 [2018-11-29 00:11:37,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-29 00:11:37,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 37 states and 46 transitions. Complement of second has 7 states. [2018-11-29 00:11:37,642 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 [2018-11-29 00:11:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-29 00:11:37,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-29 00:11:37,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:37,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-29 00:11:37,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:37,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-29 00:11:37,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:37,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2018-11-29 00:11:37,654 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:37,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-29 00:11:37,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:37,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:37,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:37,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:37,660 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:37,660 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:37,660 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:37,660 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:37,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:37,661 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:37,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:37,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:37 BoogieIcfgContainer [2018-11-29 00:11:37,669 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:37,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:37,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:37,670 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:37,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:22" (3/4) ... [2018-11-29 00:11:37,675 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:37,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:37,676 INFO L168 Benchmark]: Toolchain (without parser) took 16890.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.8 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -253.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:37,678 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:37,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:37,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:37,679 INFO L168 Benchmark]: Boogie Preprocessor took 63.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:37,680 INFO L168 Benchmark]: RCFGBuilder took 644.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:37,681 INFO L168 Benchmark]: BuchiAutomizer took 15396.85 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.7 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:37,682 INFO L168 Benchmark]: Witness Printer took 5.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:37,687 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.19 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 716.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 644.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15396.85 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.7 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 14.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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: 17 SDtfs, 18 SDslu, 13 SDs, 0 SdLazy, 14 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital634 mio100 ax100 hnf99 lsp134 ukn45 mio100 lsp83 div111 bol100 ite100 ukn100 eq181 hnf85 smp56 dnf292 smp41 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 327ms VariablesStem: 24 VariablesLoop: 20 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...