./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/add_last-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 77f70375b795111949bb5643d0f062d201ae43e4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:18:33,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:18:33,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:18:33,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:18:33,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:18:33,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:18:33,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:18:33,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:18:33,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:18:33,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:18:33,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:18:33,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:18:33,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:18:33,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:18:33,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:18:33,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:18:33,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:18:33,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:18:33,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:18:33,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:18:33,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:18:33,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:18:33,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:18:33,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:18:33,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:18:33,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:18:33,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:18:33,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:18:33,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:18:33,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:18:33,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:18:33,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:18:33,120 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:18:33,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:18:33,123 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:18:33,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:18:33,125 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:18:33,155 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:18:33,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:18:33,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:18:33,160 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:18:33,160 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:18:33,160 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:18:33,160 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:18:33,161 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:18:33,161 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:18:33,161 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:18:33,161 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:18:33,161 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:18:33,161 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:18:33,162 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:18:33,162 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:18:33,162 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:18:33,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:18:33,162 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:18:33,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:18:33,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:18:33,163 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:18:33,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:18:33,163 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:18:33,163 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:18:33,163 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:18:33,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:18:33,164 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:18:33,164 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:18:33,164 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:18:33,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:18:33,165 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:18:33,165 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:18:33,166 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 -> 77f70375b795111949bb5643d0f062d201ae43e4 [2019-01-02 00:18:33,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:18:33,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:18:33,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:18:33,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:18:33,239 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:18:33,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:33,311 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610855259/3ebe6bc340a544a9b237a2a066ef1abc/FLAGb59cc4dc6 [2019-01-02 00:18:33,823 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:18:33,824 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:33,840 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610855259/3ebe6bc340a544a9b237a2a066ef1abc/FLAGb59cc4dc6 [2019-01-02 00:18:34,132 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610855259/3ebe6bc340a544a9b237a2a066ef1abc [2019-01-02 00:18:34,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:18:34,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:18:34,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:18:34,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:18:34,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:18:34,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f03938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34, skipping insertion in model container [2019-01-02 00:18:34,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:18:34,201 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:18:34,527 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:18:34,539 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:18:34,583 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:18:34,651 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:18:34,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34 WrapperNode [2019-01-02 00:18:34,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:18:34,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:18:34,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:18:34,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:18:34,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:18:34,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:18:34,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:18:34,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:18:34,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (1/1) ... [2019-01-02 00:18:34,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:18:34,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:18:34,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:18:34,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:18:34,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (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-02 00:18:34,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:18:34,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:18:34,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:18:34,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:18:34,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:18:34,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:18:35,266 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:18:35,267 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-02 00:18:35,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:35 BoogieIcfgContainer [2019-01-02 00:18:35,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:18:35,269 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:18:35,270 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:18:35,274 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:18:35,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:35,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:18:34" (1/3) ... [2019-01-02 00:18:35,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9032e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:18:35, skipping insertion in model container [2019-01-02 00:18:35,277 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:35,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:34" (2/3) ... [2019-01-02 00:18:35,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9032e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:18:35, skipping insertion in model container [2019-01-02 00:18:35,277 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:35,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:35" (3/3) ... [2019-01-02 00:18:35,281 INFO L375 chiAutomizerObserver]: Analyzing ICFG add_last-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:35,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:18:35,389 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:18:35,389 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:18:35,389 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:18:35,390 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:18:35,390 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:18:35,391 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:18:35,391 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:18:35,391 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:18:35,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-02 00:18:35,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:18:35,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:35,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:35,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:18:35,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:35,437 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:18:35,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-02 00:18:35,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:18:35,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:35,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:35,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:18:35,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:35,448 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem7, main_#t~post8.base, main_#t~post8.offset, main_#t~mem4, main_#t~mem5, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset, main_~a~0.base, main_~a~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 12#L543true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 5#L543-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 9#L545true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~a~0.base, main_~a~0.offset := main_~arr~0.base, main_~arr~0.offset; 10#L547-3true [2019-01-02 00:18:35,449 INFO L796 eck$LassoCheckResult]: Loop: 10#L547-3true call main_#t~mem4 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem5 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4); 6#L547-1true assume !!(main_#t~mem4 != main_#t~mem5);havoc main_#t~mem5;havoc main_#t~mem4;call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~length~0 - 4, 4);call write~int(main_#t~mem6 + main_#t~mem7, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem6;havoc main_#t~mem7;main_#t~post8.base, main_#t~post8.offset := main_~a~0.base, main_~a~0.offset;main_~a~0.base, main_~a~0.offset := main_#t~post8.base, 4 + main_#t~post8.offset;havoc main_#t~post8.base, main_#t~post8.offset; 10#L547-3true [2019-01-02 00:18:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-02 00:18:35,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:35,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:35,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:35,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:35,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 1 times [2019-01-02 00:18:35,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:35,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:35,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:35,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:35,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815470, now seen corresponding path program 1 times [2019-01-02 00:18:35,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:35,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:35,860 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-02 00:18:36,002 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-02 00:18:36,229 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-01-02 00:18:36,347 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:18:36,357 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:36,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:36,359 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:36,359 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:36,359 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:36,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:36,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:36,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:36,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: add_last-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:18:36,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:36,360 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:36,387 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-02 00:18:36,410 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-02 00:18:36,416 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-02 00:18:36,420 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-02 00:18:36,424 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-02 00:18:36,432 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-02 00:18:36,465 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-02 00:18:36,497 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-02 00:18:36,530 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-02 00:18:36,543 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-02 00:18:36,556 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-02 00:18:36,560 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-02 00:18:36,997 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-01-02 00:18:37,550 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-02 00:18:37,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-02 00:18:38,097 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:38,101 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:38,103 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-02 00:18:38,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,112 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-02 00:18:38,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,115 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-02 00:18:38,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,119 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-02 00:18:38,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,122 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-02 00:18:38,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:38,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:38,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,131 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-02 00:18:38,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,134 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-02 00:18:38,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,138 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-02 00:18:38,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,141 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-02 00:18:38,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,145 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-02 00:18:38,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:38,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,148 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-02 00:18:38,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:38,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:38,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,156 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-02 00:18:38,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,157 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:18:38,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,162 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:18:38,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:38,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,193 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-02 00:18:38,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:38,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,194 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:18:38,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,196 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:18:38,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:38,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,203 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-02 00:18:38,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:38,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:38,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:38,247 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-02 00:18:38,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:38,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:38,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:38,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:38,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:38,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:38,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:38,411 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-02 00:18:38,412 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:18:38,414 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:38,416 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:18:38,422 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:38,423 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2019-01-02 00:18:38,538 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2019-01-02 00:18:38,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:18:38,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:38,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:38,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:38,741 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-02 00:18:38,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-02 00:18:38,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-01-02 00:18:38,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2019-01-02 00:18:38,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:18:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:18:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-01-02 00:18:38,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:18:38,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:38,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-02 00:18:38,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:38,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-02 00:18:38,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:38,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-01-02 00:18:38,892 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:18:38,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-02 00:18:38,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:18:38,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:18:38,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:18:38,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:38,897 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:38,897 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:38,897 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:38,897 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:18:38,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:18:38,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:18:38,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:18:38,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:18:38 BoogieIcfgContainer [2019-01-02 00:18:38,905 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:18:38,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:18:38,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:18:38,905 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:18:38,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:35" (3/4) ... [2019-01-02 00:18:38,910 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:18:38,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:18:38,911 INFO L168 Benchmark]: Toolchain (without parser) took 4772.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.7 MB in the beginning and 905.2 MB in the end (delta: 47.5 MB). Peak memory consumption was 176.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:38,912 INFO L168 Benchmark]: CDTParser took 0.55 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-02 00:18:38,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:38,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:38,915 INFO L168 Benchmark]: Boogie Preprocessor took 28.94 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-02 00:18:38,915 INFO L168 Benchmark]: RCFGBuilder took 450.33 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:38,916 INFO L168 Benchmark]: BuchiAutomizer took 3635.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.0 MB in the end (delta: 184.4 MB). Peak memory consumption was 184.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:38,917 INFO L168 Benchmark]: Witness Printer took 5.05 ms. Allocated memory is still 1.2 GB. Free memory was 912.0 MB in the beginning and 905.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:38,923 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.55 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 511.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.94 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 450.33 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3635.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.0 MB in the end (delta: 184.4 MB). Peak memory consumption was 184.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.05 ms. Allocated memory is still 1.2 GB. Free memory was 912.0 MB in the beginning and 905.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[arr] + -1 * a and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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: 8 SDtfs, 10 SDslu, 6 SDs, 0 SdLazy, 10 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital150 mio100 ax100 hnf98 lsp95 ukn83 mio100 lsp55 div100 bol100 ite100 ukn100 eq169 hnf91 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 4 VariablesLoop: 4 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...