./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/count_down-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/count_down-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 f25230c4e3ada1aa4514132cfb87afb0e539c23b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:56,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:18:56,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:18:56,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:18:56,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:18:56,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:18:56,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:18:56,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:18:56,128 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:18:56,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:18:56,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:18:56,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:18:56,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:18:56,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:18:56,133 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:18:56,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:18:56,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:18:56,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:18:56,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:18:56,140 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:18:56,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:18:56,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:18:56,145 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:18:56,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:18:56,146 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:18:56,147 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:18:56,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:18:56,148 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:18:56,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:18:56,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:18:56,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:18:56,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:18:56,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:18:56,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:18:56,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:18:56,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:18:56,154 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:56,171 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:18:56,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:18:56,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:18:56,173 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:18:56,173 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:18:56,173 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:18:56,173 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:18:56,176 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:18:56,176 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:18:56,176 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:18:56,176 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:18:56,177 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:18:56,177 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:18:56,177 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:18:56,177 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:18:56,177 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:18:56,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:18:56,178 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:18:56,178 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:18:56,178 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:18:56,178 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:18:56,180 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:18:56,181 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:18:56,181 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:18:56,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:18:56,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:18:56,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:18:56,183 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:18:56,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:18:56,183 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:18:56,183 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:18:56,184 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:18:56,184 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 -> f25230c4e3ada1aa4514132cfb87afb0e539c23b [2019-01-02 00:18:56,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:18:56,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:18:56,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:18:56,283 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:18:56,283 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:18:56,284 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:56,356 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16295784e/c5d8a39929294d14a3a02f3751925dd5/FLAGa6e9cc04e [2019-01-02 00:18:56,872 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:18:56,873 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:56,887 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16295784e/c5d8a39929294d14a3a02f3751925dd5/FLAGa6e9cc04e [2019-01-02 00:18:57,164 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16295784e/c5d8a39929294d14a3a02f3751925dd5 [2019-01-02 00:18:57,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:18:57,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:18:57,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:18:57,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:18:57,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:18:57,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:18:57" (1/1) ... [2019-01-02 00:18:57,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59db9926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:57, skipping insertion in model container [2019-01-02 00:18:57,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:18:57" (1/1) ... [2019-01-02 00:18:57,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:18:57,257 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:18:57,625 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:18:57,644 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:18:57,717 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:18:57,788 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:18:57,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:57 WrapperNode [2019-01-02 00:18:57,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:18:57,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:18:57,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:18:57,790 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:18:57,873 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:57" (1/1) ... [2019-01-02 00:18:57,897 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:57" (1/1) ... [2019-01-02 00:18:57,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:18:57,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:18:57,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:18:57,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:18:57,941 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:57" (1/1) ... [2019-01-02 00:18:57,941 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:57" (1/1) ... [2019-01-02 00:18:57,944 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:57" (1/1) ... [2019-01-02 00:18:57,945 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:57" (1/1) ... [2019-01-02 00:18:57,951 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:57" (1/1) ... [2019-01-02 00:18:57,957 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:57" (1/1) ... [2019-01-02 00:18:57,959 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:57" (1/1) ... [2019-01-02 00:18:57,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:18:57,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:18:57,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:18:57,962 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:18:57,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:57" (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:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:18:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:18:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:18:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:18:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:18:58,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:18:58,427 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:18:58,427 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-02 00:18:58,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:58 BoogieIcfgContainer [2019-01-02 00:18:58,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:18:58,429 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:18:58,429 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:18:58,433 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:18:58,434 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:58,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:18:57" (1/3) ... [2019-01-02 00:18:58,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c968faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:18:58, skipping insertion in model container [2019-01-02 00:18:58,436 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:58,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:57" (2/3) ... [2019-01-02 00:18:58,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c968faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:18:58, skipping insertion in model container [2019-01-02 00:18:58,437 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:58,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:58" (3/3) ... [2019-01-02 00:18:58,439 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:18:58,510 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:18:58,511 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:18:58,511 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:18:58,512 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:18:58,512 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:18:58,512 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:18:58,512 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:18:58,513 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:18:58,513 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:18:58,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:18:58,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-02 00:18:58,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:58,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:58,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:18:58,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:18:58,562 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:18:58,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:18:58,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-02 00:18:58,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:58,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:58,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:18:58,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:18:58,575 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~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 6#L544true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 11#L544-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; 4#L546true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 7#L547-3true [2019-01-02 00:18:58,575 INFO L796 eck$LassoCheckResult]: Loop: 7#L547-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 19#L549true assume main_~val~0 < 0;main_~val~0 := 0; 3#L549-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 5#L547-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7#L547-3true [2019-01-02 00:18:58,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:58,582 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-02 00:18:58,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:58,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:58,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:58,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-01-02 00:18:58,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:58,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:58,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-01-02 00:18:58,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:58,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:58,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:59,365 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-02 00:18:59,461 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:59,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:59,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:59,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:59,466 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:59,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:59,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:59,467 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:59,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:18:59,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:59,467 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:59,493 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:59,502 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:59,506 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:59,510 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:59,515 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:59,730 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-02 00:18:59,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:59,769 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:59,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:59,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:59,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:59,784 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:59,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:59,998 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-02 00:19:00,177 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-02 00:19:00,580 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:00,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:00,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:00,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:00,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:00,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:00,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:00,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:00,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:00,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:00,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:00,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:00,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:00,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:00,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:00,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:00,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:00,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:00,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:00,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:00,606 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:19:00,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:00,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:00,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:00,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:00,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:00,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:00,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:00,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:00,612 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:19:00,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:00,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:00,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:00,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:00,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:00,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:00,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:00,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:00,618 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:19:00,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:00,620 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:19:00,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:00,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:00,626 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:19:00,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:00,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:00,682 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:19:00,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:00,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:00,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:00,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:00,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:00,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:00,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:00,710 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:19:00,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:00,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:00,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:00,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:00,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:00,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:00,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:00,873 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:19:00,874 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:19:00,880 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:00,884 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:00,884 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:00,885 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-02 00:19:00,923 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:19:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:00,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:01,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:01,072 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:19:01,087 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:01,088 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-01-02 00:19:01,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-01-02 00:19:01,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-01-02 00:19:01,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-02 00:19:01,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:01,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-02 00:19:01,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:01,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-02 00:19:01,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:01,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-01-02 00:19:01,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:19:01,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-01-02 00:19:01,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:19:01,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:19:01,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-01-02 00:19:01,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:01,187 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-02 00:19:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-01-02 00:19:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-02 00:19:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-02 00:19:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-02 00:19:01,214 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-02 00:19:01,214 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-02 00:19:01,214 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:19:01,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-02 00:19:01,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:19:01,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:01,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:01,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:01,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:19:01,217 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 132#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 133#L544-2 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; 129#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 130#L547-3 assume !(main_~i~0 < main_~length~0); 134#L547-4 main_~j~0 := 0; 139#L554-3 [2019-01-02 00:19:01,217 INFO L796 eck$LassoCheckResult]: Loop: 139#L554-3 assume !!(main_~j~0 < main_~length~0); 138#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 136#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 137#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 139#L554-3 [2019-01-02 00:19:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:01,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-01-02 00:19:01,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:01,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:01,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:01,295 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:19:01,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:01,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:19:01,299 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:19:01,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-01-02 00:19:01,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:01,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:01,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:01,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:19:01,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:19:01,419 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-02 00:19:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:01,477 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-02 00:19:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:19:01,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-02 00:19:01,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:19:01,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-01-02 00:19:01,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-02 00:19:01,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:19:01,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-01-02 00:19:01,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:01,481 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-02 00:19:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-01-02 00:19:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-01-02 00:19:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-02 00:19:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-02 00:19:01,485 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-02 00:19:01,485 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-02 00:19:01,485 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:19:01,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-02 00:19:01,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:19:01,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:01,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:01,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:01,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:19:01,487 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 180#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 172#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 173#L544-2 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; 169#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 170#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 174#L549 assume !(main_~val~0 < 0); 167#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 168#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 171#L547-3 assume !(main_~i~0 < main_~length~0); 175#L547-4 main_~j~0 := 0; 179#L554-3 [2019-01-02 00:19:01,487 INFO L796 eck$LassoCheckResult]: Loop: 179#L554-3 assume !!(main_~j~0 < main_~length~0); 178#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 176#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 177#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 179#L554-3 [2019-01-02 00:19:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-01-02 00:19:01,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:01,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:01,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:01,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-01-02 00:19:01,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:01,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-01-02 00:19:01,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:01,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:01,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:01,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:01,684 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:19:01,995 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-01-02 00:19:02,098 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:02,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:02,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:02,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:02,099 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:02,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:02,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:02,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:02,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-02 00:19:02,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:02,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:02,104 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:19:02,107 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:19:02,113 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:19:02,251 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-02 00:19:02,296 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:19:02,303 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:19:02,305 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:19:02,307 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:19:02,309 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:19:02,311 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:19:02,314 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:19:02,320 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:19:02,628 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:02,628 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:02,629 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:19:02,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:02,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:02,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:02,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:02,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:02,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:02,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:02,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:02,632 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:19:02,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:02,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:02,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:02,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:02,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:02,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:02,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:02,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:02,634 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:19:02,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:02,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:02,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:02,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:02,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:02,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:02,660 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:02,676 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:19:02,677 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:19:02,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:02,678 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:02,679 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:02,679 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-02 00:19:02,769 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:19:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:02,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:02,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:02,879 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:19:02,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:02,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-02 00:19:02,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 4 states. [2019-01-02 00:19:02,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-02 00:19:02,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-02 00:19:02,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:02,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-02 00:19:02,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:02,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2019-01-02 00:19:02,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:02,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-01-02 00:19:02,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:19:02,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2019-01-02 00:19:02,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:19:02,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:19:02,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2019-01-02 00:19:02,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:02,966 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-02 00:19:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2019-01-02 00:19:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-02 00:19:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-02 00:19:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-02 00:19:02,968 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-02 00:19:02,968 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-02 00:19:02,968 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:19:02,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-02 00:19:02,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:19:02,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:02,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:02,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:02,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:19:02,973 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 294#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 286#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 287#L544-2 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; 281#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 282#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 284#L549 assume !(main_~val~0 < 0); 279#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 280#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 283#L547-3 assume !(main_~i~0 < main_~length~0); 285#L547-4 main_~j~0 := 0; 293#L554-3 assume !!(main_~j~0 < main_~length~0); 289#L555-3 [2019-01-02 00:19:02,974 INFO L796 eck$LassoCheckResult]: Loop: 289#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 288#L555-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 289#L555-3 [2019-01-02 00:19:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2019-01-02 00:19:02,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:02,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:02,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:03,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-01-02 00:19:03,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:03,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:03,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2019-01-02 00:19:03,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:03,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:03,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:03,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:03,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:03,324 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-01-02 00:19:03,371 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:03,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:03,372 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:03,372 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:03,372 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:03,372 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:03,372 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:03,373 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:03,373 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-02 00:19:03,373 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:03,373 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:03,376 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:19:03,380 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:19:03,381 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:19:03,384 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:19:03,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:19:03,389 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:19:03,557 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-01-02 00:19:03,699 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-02 00:19:03,699 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:19:03,701 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:19:03,703 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:19:03,705 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:19:03,707 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:19:04,013 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:04,013 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:04,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:04,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:04,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:04,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:04,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:04,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:04,016 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:19:04,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:04,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:04,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:04,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:04,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:04,019 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:19:04,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:04,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:04,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:04,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:04,023 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:19:04,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:04,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:04,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:04,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:04,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:04,026 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:19:04,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:04,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:04,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:04,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:04,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:04,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:04,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:04,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:04,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:04,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:04,044 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:19:04,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:04,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:04,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:04,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:04,054 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:19:04,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,054 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:19:04,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,056 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:19:04,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:04,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:04,064 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:19:04,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:04,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:04,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:04,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:04,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:04,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:04,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:04,100 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:19:04,100 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:19:04,101 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:04,105 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:04,105 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:04,105 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-01-02 00:19:04,129 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:19:04,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-02 00:19:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:04,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:04,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:04,266 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:19:04,267 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:04,267 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-02 00:19:04,324 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 35 transitions. Complement of second has 7 states. [2019-01-02 00:19:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-02 00:19:04,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-02 00:19:04,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:04,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-02 00:19:04,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:04,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-02 00:19:04,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:04,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-01-02 00:19:04,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:19:04,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2019-01-02 00:19:04,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:19:04,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:19:04,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-01-02 00:19:04,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:04,331 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-02 00:19:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-01-02 00:19:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-02 00:19:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-02 00:19:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-01-02 00:19:04,335 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-02 00:19:04,335 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-02 00:19:04,335 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:19:04,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-01-02 00:19:04,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:19:04,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:04,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:04,337 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:04,337 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:19:04,337 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 411#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 412#L544-2 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; 408#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 409#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L549 assume !(main_~val~0 < 0); 406#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 407#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 410#L547-3 assume !(main_~i~0 < main_~length~0); 414#L547-4 main_~j~0 := 0; 419#L554-3 assume !!(main_~j~0 < main_~length~0); 425#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 417#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 418#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 424#L554-3 assume !!(main_~j~0 < main_~length~0); 416#L555-3 [2019-01-02 00:19:04,337 INFO L796 eck$LassoCheckResult]: Loop: 416#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 415#L555-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 416#L555-3 [2019-01-02 00:19:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-01-02 00:19:04,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:04,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:04,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:04,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:04,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:19:04,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:19:04,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:19:04,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:19:04,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:19:04,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:19:04,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:19:04,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-01-02 00:19:04,712 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:19:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:04,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-01-02 00:19:04,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:04,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:04,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:04,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-02 00:19:04,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-02 00:19:04,806 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2019-01-02 00:19:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:05,199 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-01-02 00:19:05,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-02 00:19:05,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2019-01-02 00:19:05,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:19:05,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2019-01-02 00:19:05,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-02 00:19:05,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:19:05,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-01-02 00:19:05,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:05,206 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-02 00:19:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-01-02 00:19:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-02 00:19:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-02 00:19:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-01-02 00:19:05,211 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-02 00:19:05,211 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-02 00:19:05,211 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:19:05,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-01-02 00:19:05,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:19:05,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:05,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:05,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:05,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:19:05,213 INFO L794 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 565#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 557#L544 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 558#L544-2 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; 551#L546 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 552#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 555#L549 assume !(main_~val~0 < 0); 573#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 553#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 554#L547-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 556#L549 assume !(main_~val~0 < 0); 549#L549-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 550#L547-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 571#L547-3 assume !(main_~i~0 < main_~length~0); 563#L547-4 main_~j~0 := 0; 564#L554-3 assume !!(main_~j~0 < main_~length~0); 562#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 572#L555-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 569#L554-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 570#L554-3 assume !!(main_~j~0 < main_~length~0); 560#L555-3 [2019-01-02 00:19:05,213 INFO L796 eck$LassoCheckResult]: Loop: 560#L555-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 559#L555-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 560#L555-3 [2019-01-02 00:19:05,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2019-01-02 00:19:05,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:05,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:05,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:05,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:05,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-01-02 00:19:05,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:05,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:05,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:05,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:05,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2019-01-02 00:19:05,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:05,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:05,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:05,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:05,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:05,411 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:19:05,801 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 87 [2019-01-02 00:19:05,870 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:05,870 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:05,870 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:05,870 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:05,870 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:05,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:05,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:05,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:05,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2019-01-02 00:19:05,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:05,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:05,875 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:19:05,881 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:19:05,884 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:19:05,924 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:19:05,940 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:19:05,945 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:19:05,948 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:19:05,950 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:19:06,096 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-02 00:19:06,124 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:19:06,130 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:19:06,134 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:19:06,144 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:19:06,396 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:06,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:06,397 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:19:06,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:06,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:06,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:06,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,402 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:19:06,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:06,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:06,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:06,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,420 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:19:06,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:06,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:06,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:06,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,426 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:19:06,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:06,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:06,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:06,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,432 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:19:06,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:06,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:06,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:06,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,438 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:19:06,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:06,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,445 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:19:06,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,448 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:19:06,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,450 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:19:06,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,458 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:19:06,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:06,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,465 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:19:06,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:06,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,477 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:19:06,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:06,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,486 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:19:06,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:06,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,501 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:19:06,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:06,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:06,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:06,522 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:19:06,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:06,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:06,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:06,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:06,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:06,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:06,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:06,528 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:06,529 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:19:06,529 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:19:06,531 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:06,532 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:19:06,532 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:06,532 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2019-01-02 00:19:06,587 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:19:06,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-02 00:19:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:06,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:06,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:06,650 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:19:06,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:06,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-02 00:19:06,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-01-02 00:19:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-02 00:19:06,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-02 00:19:06,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:06,688 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:19:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:06,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:06,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:06,769 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:19:06,770 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:06,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-02 00:19:06,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-01-02 00:19:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-02 00:19:06,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-02 00:19:06,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:06,792 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:19:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:06,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:06,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:06,933 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:19:06,933 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:19:06,934 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-02 00:19:06,961 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2019-01-02 00:19:06,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:19:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-02 00:19:06,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2019-01-02 00:19:06,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:06,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2019-01-02 00:19:06,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:06,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2019-01-02 00:19:06,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:06,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-01-02 00:19:06,967 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:06,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-01-02 00:19:06,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:19:06,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:19:06,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:19:06,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:06,968 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:06,968 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:06,968 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:06,968 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:19:06,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:19:06,968 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:06,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:19:06,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:19:06 BoogieIcfgContainer [2019-01-02 00:19:06,975 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:19:06,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:19:06,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:19:06,975 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:19:06,976 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:58" (3/4) ... [2019-01-02 00:19:06,979 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:19:06,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:19:06,980 INFO L168 Benchmark]: Toolchain (without parser) took 9809.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 951.4 MB in the beginning and 837.3 MB in the end (delta: 114.1 MB). Peak memory consumption was 326.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:06,981 INFO L168 Benchmark]: CDTParser took 0.17 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:19:06,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.08 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 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:19:06,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:06,983 INFO L168 Benchmark]: Boogie Preprocessor took 32.03 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:19:06,984 INFO L168 Benchmark]: RCFGBuilder took 466.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:06,985 INFO L168 Benchmark]: BuchiAutomizer took 8545.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 837.3 MB in the end (delta: 268.5 MB). Peak memory consumption was 344.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:06,986 INFO L168 Benchmark]: Witness Printer took 3.94 ms. Allocated memory is still 1.2 GB. Free memory is still 837.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:06,994 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.17 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 617.08 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 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 138.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 466.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8545.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 837.3 MB in the end (delta: 268.5 MB). Peak memory consumption was 344.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.94 ms. Allocated memory is still 1.2 GB. Free memory is still 837.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 206 SDslu, 76 SDs, 0 SdLazy, 174 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital130 mio100 ax100 hnf98 lsp94 ukn80 mio100 lsp56 div100 bol100 ite100 ukn100 eq161 hnf90 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...