./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/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 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:39:37,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:39:37,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:39:37,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:39:37,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:39:37,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:39:37,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:39:37,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:39:37,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:39:37,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:39:37,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:39:37,149 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:39:37,150 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:39:37,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:39:37,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:39:37,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:39:37,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:39:37,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:39:37,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:39:37,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:39:37,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:39:37,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:39:37,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:39:37,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:39:37,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:39:37,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:39:37,164 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:39:37,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:39:37,165 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:39:37,166 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:39:37,166 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:39:37,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:39:37,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:39:37,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:39:37,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:39:37,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:39:37,168 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:39:37,179 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:39:37,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:39:37,180 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:39:37,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:39:37,180 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:39:37,180 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:39:37,181 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:39:37,181 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:39:37,181 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:39:37,181 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:39:37,181 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:39:37,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:39:37,182 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:39:37,182 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:39:37,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:39:37,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:39:37,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:39:37,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:39:37,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:39:37,183 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:39:37,183 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:39:37,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:39:37,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:39:37,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:39:37,183 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:39:37,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:39:37,184 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:39:37,184 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:39:37,184 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:39:37,185 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_6cdff19b-3718-4750-bbad-94c4a9b19676/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 -> 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 [2018-11-23 15:39:37,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:39:37,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:39:37,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:39:37,221 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:39:37,221 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:39:37,222 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-23 15:39:37,268 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/data/0938dec0a/21c7ab0c31a5490b94e4538ea949c81e/FLAGd9492eb82 [2018-11-23 15:39:37,632 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:39:37,632 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-23 15:39:37,642 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/data/0938dec0a/21c7ab0c31a5490b94e4538ea949c81e/FLAGd9492eb82 [2018-11-23 15:39:38,029 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/bin-2019/uautomizer/data/0938dec0a/21c7ab0c31a5490b94e4538ea949c81e [2018-11-23 15:39:38,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:39:38,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:39:38,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:39:38,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:39:38,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:39:38,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6b7d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38, skipping insertion in model container [2018-11-23 15:39:38,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:39:38,073 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:39:38,250 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:39:38,257 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:39:38,285 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:39:38,352 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:39:38,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38 WrapperNode [2018-11-23 15:39:38,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:39:38,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:39:38,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:39:38,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:39:38,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:39:38,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:39:38,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:39:38,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:39:38,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... [2018-11-23 15:39:38,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:39:38,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:39:38,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:39:38,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:39:38,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cdff19b-3718-4750-bbad-94c4a9b19676/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-11-23 15:39:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:39:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:39:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:39:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:39:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:39:38,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:39:38,595 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:39:38,596 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 15:39:38,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:39:38 BoogieIcfgContainer [2018-11-23 15:39:38,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:39:38,596 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:39:38,597 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:39:38,600 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:39:38,600 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:39:38,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:39:38" (1/3) ... [2018-11-23 15:39:38,601 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fbbea20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:39:38, skipping insertion in model container [2018-11-23 15:39:38,601 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:39:38,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:39:38" (2/3) ... [2018-11-23 15:39:38,602 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fbbea20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:39:38, skipping insertion in model container [2018-11-23 15:39:38,602 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:39:38,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:39:38" (3/3) ... [2018-11-23 15:39:38,603 INFO L375 chiAutomizerObserver]: Analyzing ICFG Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-23 15:39:38,635 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:39:38,636 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:39:38,636 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:39:38,636 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:39:38,636 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:39:38,636 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:39:38,636 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:39:38,636 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:39:38,636 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:39:38,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 15:39:38,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:39:38,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:39:38,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:39:38,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:39:38,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:39:38,665 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:39:38,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-23 15:39:38,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:39:38,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:39:38,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:39:38,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 15:39:38,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:39:38,672 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 5#L556true assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 7#L556-2true assume !subxy_#t~short9;havoc subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8; 6#L559-3true [2018-11-23 15:39:38,672 INFO L796 eck$LassoCheckResult]: Loop: 6#L559-3true call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 3#L559-1true assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post12;havoc subxy_#t~mem11;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~post14;havoc subxy_#t~mem13; 6#L559-3true [2018-11-23 15:39:38,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:38,675 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-11-23 15:39:38,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:39:38,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:39:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:38,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:39:38,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:38,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:38,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1542, now seen corresponding path program 1 times [2018-11-23 15:39:38,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:39:38,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:39:38,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:38,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:39:38,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:38,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:38,804 INFO L82 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2018-11-23 15:39:38,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:39:38,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:39:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:38,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:39:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:39,391 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 118 [2018-11-23 15:39:39,530 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-23 15:39:39,538 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:39:39,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:39:39,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:39:39,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:39:39,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:39:39,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:39:39,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:39:39,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:39:39,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 15:39:39,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:39:39,541 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:39:39,559 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-23 15:39:39,564 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-23 15:39:39,565 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-23 15:39:39,566 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-23 15:39:39,568 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-23 15:39:39,570 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-23 15:39:39,571 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-23 15:39:39,574 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-23 15:39:39,575 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-23 15:39:39,582 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-23 15:39:39,894 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-23 15:39:39,966 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-23 15:39:39,968 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-23 15:39:39,969 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-23 15:39:39,970 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-23 15:39:39,972 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-23 15:39:39,973 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-23 15:39:39,974 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-23 15:39:39,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:39:39,976 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-23 15:39:39,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:39:39,979 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-23 15:39:39,980 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-23 15:39:39,982 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-23 15:39:39,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:39:39,984 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-23 15:39:39,985 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-23 15:39:39,986 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-23 15:39:39,988 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-23 15:39:40,376 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:39:40,380 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:39:40,382 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-23 15:39:40,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:40,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:40,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:40,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,387 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-23 15:39:40,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:40,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:40,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:40,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,389 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-23 15:39:40,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:40,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:40,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:40,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,391 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-23 15:39:40,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:40,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:40,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:40,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,393 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-23 15:39:40,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:40,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:40,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:40,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,395 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-23 15:39:40,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:40,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:40,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:40,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:39:40,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:40,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:40,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:40,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,399 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-23 15:39:40,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:40,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:40,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:40,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:39:40,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:40,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,408 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-23 15:39:40,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:40,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,414 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-23 15:39:40,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,415 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:39:40,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,417 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:39:40,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,425 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-23 15:39:40,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:40,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,454 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-23 15:39:40,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,454 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:39:40,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,456 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:39:40,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,461 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-23 15:39:40,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:40,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,466 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-23 15:39:40,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:40,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,475 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-23 15:39:40,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:40,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:40,478 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-23 15:39:40,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:40,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:40,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:40,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:40,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:40,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:40,494 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:39:40,502 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:39:40,502 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:39:40,504 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:39:40,506 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:39:40,506 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:39:40,507 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1 Supporting invariants [] [2018-11-23 15:39:40,613 INFO L297 tatePredicateManager]: 33 out of 36 supporting invariants were superfluous and have been removed [2018-11-23 15:39:40,621 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:39:40,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:39:40,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:39:40,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-23 15:39:40,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 15:39:40,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:39:40,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:39:40,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:39:40,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 15:39:40,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:39:40,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:39:40,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:39:40,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:39:40,715 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-11-23 15:39:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:39:40,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:39:40,730 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-23 15:39:40,743 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:39:40,744 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-23 15:39:40,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 32 states and 41 transitions. Complement of second has 9 states. [2018-11-23 15:39:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:39:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:39:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-23 15:39:40,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 15:39:40,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:39:40,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 15:39:40,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:39:40,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-23 15:39:40,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:39:40,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2018-11-23 15:39:40,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:39:40,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 15 transitions. [2018-11-23 15:39:40,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 15:39:40,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 15:39:40,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2018-11-23 15:39:40,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:39:40,811 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-23 15:39:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2018-11-23 15:39:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-11-23 15:39:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 15:39:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 15:39:40,827 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:39:40,827 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 15:39:40,827 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:39:40,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 15:39:40,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:39:40,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:39:40,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:39:40,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 15:39:40,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:39:40,828 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 242#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 243#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 250#L556-2 assume !subxy_#t~short9;havoc subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8; 251#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 244#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 245#L563-2 [2018-11-23 15:39:40,829 INFO L796 eck$LassoCheckResult]: Loop: 245#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 249#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem15;havoc subxy_#t~mem16;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem17;havoc subxy_#t~post18;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem19;havoc subxy_#t~post20; 245#L563-2 [2018-11-23 15:39:40,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash 889572332, now seen corresponding path program 1 times [2018-11-23 15:39:40,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:39:40,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:39:40,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:40,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:39:40,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:39:40,947 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-23 15:39:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:39:40,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:39:40,950 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:39:40,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-11-23 15:39:40,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:39:40,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:39:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:40,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:39:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:41,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:39:41,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:39:41,008 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-23 15:39:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:39:41,059 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-23 15:39:41,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:39:41,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-23 15:39:41,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:39:41,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 13 transitions. [2018-11-23 15:39:41,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 15:39:41,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 15:39:41,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-23 15:39:41,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:39:41,061 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-23 15:39:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-23 15:39:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-23 15:39:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 15:39:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-23 15:39:41,062 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 15:39:41,062 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 15:39:41,062 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:39:41,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-23 15:39:41,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 15:39:41,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:39:41,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:39:41,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 15:39:41,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:39:41,064 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 280#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 288#L556-2 assume !subxy_#t~short9;havoc subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8; 287#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 283#L559-1 assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post12;havoc subxy_#t~mem11;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~post14;havoc subxy_#t~mem13; 284#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 281#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 282#L563-2 [2018-11-23 15:39:41,064 INFO L796 eck$LassoCheckResult]: Loop: 282#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 286#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem15;havoc subxy_#t~mem16;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem17;havoc subxy_#t~post18;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem19;havoc subxy_#t~post20; 282#L563-2 [2018-11-23 15:39:41,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:41,064 INFO L82 PathProgramCache]: Analyzing trace with hash 180521649, now seen corresponding path program 1 times [2018-11-23 15:39:41,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:39:41,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:39:41,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:41,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:39:41,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:41,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 2 times [2018-11-23 15:39:41,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:39:41,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:39:41,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:41,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:39:41,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:41,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:41,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1682613814, now seen corresponding path program 1 times [2018-11-23 15:39:41,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:39:41,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:39:41,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:41,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:39:41,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:39:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:39:41,771 WARN L180 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 135 [2018-11-23 15:39:41,952 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-23 15:39:41,954 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:39:41,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:39:41,954 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:39:41,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:39:41,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:39:41,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:39:41,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:39:41,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:39:41,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 15:39:41,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:39:41,955 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:39:41,958 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-23 15:39:41,961 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-23 15:39:41,962 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-23 15:39:41,963 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-23 15:39:42,267 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2018-11-23 15:39:42,352 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-23 15:39:42,354 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-23 15:39:42,358 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-23 15:39:42,359 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-23 15:39:42,360 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-23 15:39:42,361 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-23 15:39:42,362 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-23 15:39:42,363 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-23 15:39:42,364 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-23 15:39:42,365 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-23 15:39:42,366 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-23 15:39:42,368 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-23 15:39:42,369 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-23 15:39:42,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-23 15:39:42,371 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-23 15:39:42,372 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-23 15:39:42,373 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-23 15:39:42,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-23 15:39:42,375 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-23 15:39:42,376 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-23 15:39:42,377 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-23 15:39:42,379 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-23 15:39:42,379 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-23 15:39:42,380 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-23 15:39:42,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:39:42,694 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:39:42,694 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-23 15:39:42,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:42,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:42,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:42,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,697 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-23 15:39:42,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:42,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:42,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:42,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,699 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-23 15:39:42,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:39:42,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:39:42,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:39:42,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,701 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-23 15:39:42,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,701 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:39:42,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,703 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:39:42,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,707 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-23 15:39:42,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,707 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:39:42,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,709 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:39:42,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,713 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-23 15:39:42,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:42,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,717 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-23 15:39:42,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:42,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,722 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-23 15:39:42,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:42,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,725 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-23 15:39:42,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,725 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:39:42,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,727 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:39:42,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,730 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-23 15:39:42,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:42,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,735 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-23 15:39:42,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:42,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,752 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-23 15:39:42,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:42,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,760 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-23 15:39:42,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:42,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,764 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-23 15:39:42,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,765 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:39:42,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,766 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:39:42,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:39:42,769 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-23 15:39:42,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:39:42,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:39:42,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:39:42,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:39:42,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:39:42,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:39:42,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:39:42,798 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 15:39:42,798 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 15:39:42,799 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:39:42,799 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:39:42,800 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:39:42,800 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2 Supporting invariants [] [2018-11-23 15:39:42,950 INFO L297 tatePredicateManager]: 34 out of 37 supporting invariants were superfluous and have been removed [2018-11-23 15:39:42,954 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:39:42,955 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:39:42,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:39:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:39:42,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:39:42,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-23 15:39:42,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 15:39:42,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:39:43,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:39:43,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:39:43,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 15:39:43,003 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:39:43,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:39:43,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:39:43,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:39:43,020 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-11-23 15:39:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:39:43,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:39:43,051 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-23 15:39:43,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 15:39:43,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-23 15:39:43,086 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 12 states and 15 transitions. Complement of second has 5 states. [2018-11-23 15:39:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 15:39:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:39:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 15:39:43,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 15:39:43,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:39:43,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 15:39:43,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:39:43,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 15:39:43,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:39:43,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2018-11-23 15:39:43,088 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:39:43,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-23 15:39:43,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:39:43,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:39:43,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:39:43,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:39:43,089 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:39:43,089 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:39:43,089 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:39:43,089 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:39:43,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:39:43,089 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:39:43,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:39:43,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:39:43 BoogieIcfgContainer [2018-11-23 15:39:43,094 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:39:43,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:39:43,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:39:43,094 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:39:43,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:39:38" (3/4) ... [2018-11-23 15:39:43,098 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:39:43,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:39:43,098 INFO L168 Benchmark]: Toolchain (without parser) took 5066.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 190.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:39:43,099 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-11-23 15:39:43,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:39:43,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:39:43,101 INFO L168 Benchmark]: Boogie Preprocessor took 15.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:39:43,101 INFO L168 Benchmark]: RCFGBuilder took 199.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:39:43,102 INFO L168 Benchmark]: BuchiAutomizer took 4497.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 204.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:39:43,102 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:39:43,106 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 319.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4497.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 204.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 - 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 unknown-#memory_int-unknown[i][i] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 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: 21 SDtfs, 24 SDslu, 16 SDs, 0 SdLazy, 44 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital779 mio100 ax102 hnf100 lsp95 ukn31 mio100 lsp34 div100 bol100 ite100 ukn100 eq192 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 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...