./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77498d00b446eec99f943fd8f68173cd9df2461a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:22:21,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:22:21,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:22:21,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:22:21,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:22:21,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:22:21,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:22:21,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:22:21,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:22:21,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:22:21,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:22:21,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:22:21,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:22:21,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:22:21,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:22:21,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:22:21,038 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:22:21,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:22:21,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:22:21,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:22:21,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:22:21,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:22:21,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:22:21,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:22:21,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:22:21,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:22:21,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:22:21,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:22:21,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:22:21,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:22:21,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:22:21,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:22:21,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:22:21,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:22:21,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:22:21,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:22:21,075 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:22:21,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:22:21,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:22:21,114 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:22:21,114 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:22:21,114 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:22:21,114 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:22:21,115 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:22:21,115 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:22:21,115 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:22:21,115 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:22:21,115 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:22:21,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:22:21,118 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:22:21,118 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:22:21,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:22:21,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:22:21,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:22:21,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:22:21,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:22:21,121 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:22:21,121 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:22:21,122 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:22:21,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:22:21,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:22:21,122 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:22:21,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:22:21,122 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:22:21,123 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:22:21,129 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:22:21,129 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77498d00b446eec99f943fd8f68173cd9df2461a [2018-11-28 23:22:21,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:22:21,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:22:21,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:22:21,215 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:22:21,216 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:22:21,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i [2018-11-28 23:22:21,272 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351836b70/087bc6fc86f54d3e893bc0df6187ac62/FLAGf30fe94e5 [2018-11-28 23:22:21,754 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:22:21,755 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i [2018-11-28 23:22:21,767 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351836b70/087bc6fc86f54d3e893bc0df6187ac62/FLAGf30fe94e5 [2018-11-28 23:22:22,091 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351836b70/087bc6fc86f54d3e893bc0df6187ac62 [2018-11-28 23:22:22,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:22:22,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:22:22,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:22:22,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:22:22,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:22:22,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620e9de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22, skipping insertion in model container [2018-11-28 23:22:22,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:22:22,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:22:22,646 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:22:22,658 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:22:22,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:22:22,874 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:22:22,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22 WrapperNode [2018-11-28 23:22:22,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:22:22,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:22:22,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:22:22,876 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:22:22,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:22:22,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:22:22,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:22:22,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:22:22,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... [2018-11-28 23:22:22,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:22:22,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:22:22,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:22:22,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:22:22,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:23,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:22:23,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:22:23,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:22:23,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:22:23,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:22:23,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:22:23,396 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:22:23,396 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 23:22:23,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:23 BoogieIcfgContainer [2018-11-28 23:22:23,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:22:23,397 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:22:23,398 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:22:23,405 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:22:23,406 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:22:23,409 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:22:22" (1/3) ... [2018-11-28 23:22:23,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ceae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:22:23, skipping insertion in model container [2018-11-28 23:22:23,410 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:22:23,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:22:22" (2/3) ... [2018-11-28 23:22:23,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ceae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:22:23, skipping insertion in model container [2018-11-28 23:22:23,412 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:22:23,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:23" (3/3) ... [2018-11-28 23:22:23,414 INFO L375 chiAutomizerObserver]: Analyzing ICFG array07_alloca_true-termination.c.i [2018-11-28 23:22:23,482 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:22:23,483 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:22:23,483 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:22:23,483 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:22:23,484 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:22:23,484 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:22:23,484 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:22:23,484 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:22:23,484 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:22:23,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:22:23,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-28 23:22:23,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:23,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:23,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:22:23,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:22:23,539 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:22:23,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:22:23,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-28 23:22:23,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:23,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:23,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:22:23,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:22:23,552 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 14#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2018-11-28 23:22:23,552 INFO L796 eck$LassoCheckResult]: Loop: 15#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2018-11-28 23:22:23,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-28 23:22:23,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:23,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:23,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:23,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:23,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2018-11-28 23:22:23,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:23,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:23,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:23,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:23,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:23,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:23,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2018-11-28 23:22:23,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:23,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:23,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:23,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:23,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:23,898 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 23:22:24,338 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-11-28 23:22:24,444 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:24,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:24,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:24,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:24,446 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:24,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:24,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:24,446 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:24,446 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:22:24,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:24,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:24,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:24,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:24,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:24,732 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-28 23:22:24,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:24,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:24,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:24,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:24,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:24,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:25,540 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:25,546 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:25,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:25,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:25,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:25,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:25,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:25,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:25,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:25,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:25,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:25,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:25,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:25,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:25,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:25,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:25,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:25,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:25,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:25,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:25,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:25,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:25,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:25,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:25,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:25,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:25,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:25,767 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:25,847 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:22:25,847 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:22:25,850 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:25,854 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:22:25,855 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:25,856 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-11-28 23:22:25,937 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:22:25,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:22:26,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:26,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:26,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:26,177 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 [2018-11-28 23:22:26,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2018-11-28 23:22:26,326 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2018-11-28 23:22:26,327 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 [2018-11-28 23:22:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:22:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-28 23:22:26,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:22:26,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:26,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:22:26,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:26,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:22:26,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:26,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-28 23:22:26,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:22:26,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2018-11-28 23:22:26,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:22:26,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:22:26,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 23:22:26,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:26,346 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:22:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 23:22:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 23:22:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:22:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:22:26,372 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:22:26,372 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:22:26,373 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:22:26,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 23:22:26,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:22:26,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:26,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:26,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:26,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:22:26,375 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 105#L367 assume !(main_~length~0 < 1); 108#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2018-11-28 23:22:26,375 INFO L796 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 103#L374-2 [2018-11-28 23:22:26,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:26,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2018-11-28 23:22:26,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:26,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:26,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:26,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:22:26,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:22:26,478 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:22:26,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2018-11-28 23:22:26,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:26,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:26,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:26,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:22:26,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:22:26,546 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:22:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:22:26,627 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-28 23:22:26,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:22:26,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-28 23:22:26,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:22:26,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-28 23:22:26,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:22:26,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:22:26,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-28 23:22:26,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:26,633 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 23:22:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-28 23:22:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-28 23:22:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:22:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 23:22:26,635 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:22:26,635 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:22:26,635 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:22:26,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 23:22:26,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:22:26,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:22:26,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:22:26,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:22:26,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:22:26,637 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 133#L367 assume !(main_~length~0 < 1); 136#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2018-11-28 23:22:26,637 INFO L796 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 131#L374-2 [2018-11-28 23:22:26,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2018-11-28 23:22:26,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:26,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:26,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:26,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2018-11-28 23:22:26,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:26,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:26,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:22:26,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:26,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2018-11-28 23:22:26,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:26,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:26,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:26,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:27,283 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-11-28 23:22:27,364 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:27,364 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:27,364 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:27,364 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:27,364 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:27,364 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:27,364 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:27,365 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:27,365 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:22:27,365 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:27,365 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:27,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,508 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-28 23:22:27,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:27,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:27,981 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:27,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:27,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:27,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:27,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:27,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:27,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:27,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:27,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:27,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:27,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:27,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:27,985 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:27,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:27,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:27,988 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:27,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:27,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:27,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:27,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:27,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:27,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:27,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:28,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:28,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:28,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:28,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,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 [2018-11-28 23:22:28,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:28,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:28,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:28,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:28,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:28,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:28,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:28,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:28,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:28,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:28,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,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 [2018-11-28 23:22:28,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:28,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:28,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:28,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:28,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:28,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:28,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:28,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:28,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:28,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:28,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:28,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:28,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,073 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 23:22:28,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:28,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,076 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:22:28,076 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:22:28,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:28,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,084 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:28,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,085 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:22:28,089 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:22:28,089 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 23:22:28,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,118 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:22:28,122 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 23:22:28,123 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 23:22:28,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:28,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:28,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:28,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:28,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:28,128 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:22:28,133 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 23:22:28,133 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-28 23:22:28,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:28,241 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:22:28,241 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:22:28,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:28,243 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2018-11-28 23:22:28,243 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:28,244 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 + 1 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-28 23:22:28,274 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:22:28,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:28,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:28,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:22:28,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:28,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:28,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:28,342 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:22:28,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2018-11-28 23:22:28,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 2 states. [2018-11-28 23:22:28,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 23:22:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:22:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2018-11-28 23:22:28,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2018-11-28 23:22:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:28,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2018-11-28 23:22:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:28,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:22:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:28,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-28 23:22:28,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:28,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2018-11-28 23:22:28,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:22:28,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:22:28,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:22:28,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:28,359 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:28,359 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:28,359 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:28,360 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:22:28,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:22:28,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:28,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:22:28,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:22:28 BoogieIcfgContainer [2018-11-28 23:22:28,366 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:22:28,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:22:28,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:22:28,367 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:22:28,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:22:23" (3/4) ... [2018-11-28 23:22:28,371 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:22:28,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:22:28,372 INFO L168 Benchmark]: Toolchain (without parser) took 6276.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 952.7 MB in the beginning and 821.2 MB in the end (delta: 131.5 MB). Peak memory consumption was 251.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:28,373 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:28,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:28,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:28,376 INFO L168 Benchmark]: Boogie Preprocessor took 29.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:28,376 INFO L168 Benchmark]: RCFGBuilder took 431.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:28,377 INFO L168 Benchmark]: BuchiAutomizer took 4969.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 821.2 MB in the end (delta: 251.1 MB). Peak memory consumption was 251.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:28,378 INFO L168 Benchmark]: Witness Printer took 4.64 ms. Allocated memory is still 1.1 GB. Free memory is still 821.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:28,383 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 776.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 431.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4969.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 821.2 MB in the end (delta: 251.1 MB). Peak memory consumption was 251.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.64 ms. Allocated memory is still 1.1 GB. Free memory is still 821.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 2 * unknown-#memory_int-unknown[arr][arr] + 1 else -2 * j + 2 * length) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 33 SDslu, 12 SDs, 0 SdLazy, 23 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf99 lsp94 ukn78 mio100 lsp68 div100 bol100 ite100 ukn100 eq169 hnf91 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 12 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...