./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Break-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Break-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer --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 c390f2bb68198128822c2beb94f8e36148a0f7be ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:06,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:06,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:06,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:06,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:06,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:06,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:06,145 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:06,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:06,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:06,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:06,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:06,149 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:06,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:06,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:06,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:06,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:06,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:06,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:06,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:06,157 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:06,158 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:06,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:06,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:06,161 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:06,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:06,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:06,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:06,165 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:06,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:06,166 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:06,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:06,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:06,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:06,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:06,169 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:06,169 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:10:06,181 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:06,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:06,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:06,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:06,183 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:06,183 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:06,183 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:06,184 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:06,184 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:06,184 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:06,184 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:06,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:06,184 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:06,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:06,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:06,185 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:06,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:06,185 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:06,185 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:06,185 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:06,186 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:06,186 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:06,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:06,186 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:06,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:06,186 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:06,186 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:06,189 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:06,189 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer 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 -> c390f2bb68198128822c2beb94f8e36148a0f7be [2018-10-27 06:10:06,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:06,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:06,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:06,228 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:06,229 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:06,229 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_Break-alloca_true-termination.c.i [2018-10-27 06:10:06,278 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/data/e4e2cfec5/a11473956cf04cebb07f1c5114c1ec7d/FLAGdba71af62 [2018-10-27 06:10:06,696 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:06,697 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/sv-benchmarks/c/termination-memory-alloca/java_Break-alloca_true-termination.c.i [2018-10-27 06:10:06,708 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/data/e4e2cfec5/a11473956cf04cebb07f1c5114c1ec7d/FLAGdba71af62 [2018-10-27 06:10:06,720 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/data/e4e2cfec5/a11473956cf04cebb07f1c5114c1ec7d [2018-10-27 06:10:06,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:06,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:06,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:06,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:06,729 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:06,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:06" (1/1) ... [2018-10-27 06:10:06,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13682a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:06, skipping insertion in model container [2018-10-27 06:10:06,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:06" (1/1) ... [2018-10-27 06:10:06,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:06,774 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:07,020 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:07,029 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:07,059 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:07,092 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:07,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07 WrapperNode [2018-10-27 06:10:07,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:07,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:07,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:07,093 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:07,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:07,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:07,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:07,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:07,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... [2018-10-27 06:10:07,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:07,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:07,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:07,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:07,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822882d1-da77-41d6-b13e-69d32b8c316d/bin-2019/uautomizer/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-10-27 06:10:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:10:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:10:07,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:07,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:07,605 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:07,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:07 BoogieIcfgContainer [2018-10-27 06:10:07,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:07,606 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:07,606 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:07,609 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:07,610 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:07,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:06" (1/3) ... [2018-10-27 06:10:07,611 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38d48d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:07, skipping insertion in model container [2018-10-27 06:10:07,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:07,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:07" (2/3) ... [2018-10-27 06:10:07,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38d48d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:07, skipping insertion in model container [2018-10-27 06:10:07,613 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:07,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:07" (3/3) ... [2018-10-27 06:10:07,614 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_Break-alloca_true-termination.c.i [2018-10-27 06:10:07,658 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:07,659 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:07,659 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:07,659 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:07,659 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:07,659 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:07,659 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:07,659 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:07,659 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:07,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:10:07,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-10-27 06:10:07,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:07,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:07,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:10:07,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:07,706 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:07,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:10:07,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-10-27 06:10:07,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:07,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:07,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:10:07,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:07,716 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem4, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 19#L550true SUMMARY for call write~int(0, main_~i~0.base, main_~i~0.offset, 4); srcloc: L550 22#L550-1true SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L550-1 20#L552-2true [2018-10-27 06:10:07,716 INFO L795 eck$LassoCheckResult]: Loop: 20#L552-2true assume true; 13#L552true assume !false; 9#L553true SUMMARY for call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L553 14#L553-1true assume !(main_#t~mem4 > 10);havoc main_#t~mem4; 6#L554true SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 10#L554-1true main_#t~post6 := main_#t~mem5; 15#L554-2true SUMMARY for call write~int(main_#t~post6 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L554-2 17#L554-3true havoc main_#t~mem5;havoc main_#t~post6; 5#L555true SUMMARY for call main_#t~mem7 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L555 7#L555-1true main_#t~post8 := main_#t~mem7; 11#L555-2true SUMMARY for call write~int(main_#t~post8 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L555-2 16#L555-3true havoc main_#t~post8;havoc main_#t~mem7; 20#L552-2true [2018-10-27 06:10:07,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-10-27 06:10:07,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:07,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:07,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:07,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1880586096, now seen corresponding path program 1 times [2018-10-27 06:10:07,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:07,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:07,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:07,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:07,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:07,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash -442852781, now seen corresponding path program 1 times [2018-10-27 06:10:07,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:07,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:08,070 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 06:10:08,185 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 06:10:08,525 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-10-27 06:10:08,643 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 06:10:08,652 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:08,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:08,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:08,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:08,654 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:08,654 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:08,654 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:08,654 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:08,654 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Break-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:10:08,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:08,655 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:08,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:08,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:08,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,191 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-10-27 06:10:09,309 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-10-27 06:10:09,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:09,832 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:09,837 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:09,838 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-10-27 06:10:09,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:09,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:09,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:09,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,848 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-10-27 06:10:09,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:09,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:09,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:09,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,851 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-10-27 06:10:09,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:09,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,874 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-10-27 06:10:09,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:09,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,885 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,886 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-10-27 06:10:09,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:09,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,895 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-10-27 06:10:09,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:09,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,905 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-10-27 06:10:09,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,906 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:09,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,909 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:09,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,924 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-10-27 06:10:09,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:09,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,938 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-10-27 06:10:09,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:09,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,972 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-10-27 06:10:09,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:09,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:09,990 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-10-27 06:10:09,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:09,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:09,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:09,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:09,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:09,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:10,006 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:10,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:10,034 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:10,043 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:10,044 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:10,045 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:10,045 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 21 Supporting invariants [] [2018-10-27 06:10:10,081 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:10:10,086 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:10,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:10,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:10,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:10,432 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:10,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-10-27 06:10:10,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-10-27 06:10:10,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:10,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:10,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:10,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:10:10,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:10,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-10-27 06:10:10,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-10-27 06:10:10,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:10,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:10,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-10-27 06:10:10,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:10:10,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:10:10,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 06:10:10,853 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:41 [2018-10-27 06:10:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:10,878 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-10-27 06:10:10,879 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 10 states. [2018-10-27 06:10:10,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 10 states. Result 56 states and 59 transitions. Complement of second has 14 states. [2018-10-27 06:10:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:10:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-10-27 06:10:10,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 4 letters. Loop has 12 letters. [2018-10-27 06:10:10,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:10,979 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:10,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:11,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:11,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:11,210 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:11,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-10-27 06:10:11,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-10-27 06:10:11,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:11,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:11,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:11,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:10:11,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:11,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-10-27 06:10:11,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2018-10-27 06:10:11,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-27 06:10:11,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:11,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-10-27 06:10:11,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:11,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:10:11,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 06:10:11,469 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:41 [2018-10-27 06:10:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:11,481 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2018-10-27 06:10:11,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 10 states. [2018-10-27 06:10:11,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 10 states. Result 43 states and 46 transitions. Complement of second has 19 states. [2018-10-27 06:10:11,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:10:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2018-10-27 06:10:11,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 27 transitions. Stem has 4 letters. Loop has 12 letters. [2018-10-27 06:10:11,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:11,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 27 transitions. Stem has 16 letters. Loop has 12 letters. [2018-10-27 06:10:11,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:11,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 27 transitions. Stem has 4 letters. Loop has 24 letters. [2018-10-27 06:10:11,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:11,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 46 transitions. [2018-10-27 06:10:11,687 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:11,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2018-10-27 06:10:11,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:11,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:11,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:11,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:11,691 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:11,691 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:11,691 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:11,691 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:11,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:11,691 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:11,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:11,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:11 BoogieIcfgContainer [2018-10-27 06:10:11,697 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:11,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:11,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:11,698 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:11,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:07" (3/4) ... [2018-10-27 06:10:11,702 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:11,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:11,703 INFO L168 Benchmark]: Toolchain (without parser) took 4978.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -42.8 MB). Peak memory consumption was 117.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:11,703 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:11,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.75 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:11,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.44 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:11,704 INFO L168 Benchmark]: Boogie Preprocessor took 77.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -220.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:11,705 INFO L168 Benchmark]: RCFGBuilder took 396.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:11,705 INFO L168 Benchmark]: BuchiAutomizer took 4091.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 137.7 MB). Peak memory consumption was 137.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:11,705 INFO L168 Benchmark]: Witness Printer took 4.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:11,708 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.75 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 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 37.44 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -220.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 396.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4091.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 137.7 MB). Peak memory consumption was 137.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 21 and consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 35 SDslu, 61 SDs, 0 SdLazy, 98 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax108 hnf100 lsp88 ukn76 mio100 lsp40 div100 bol100 ite100 ukn100 eq186 hnf88 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms 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...