./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/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 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:00:20,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:00:20,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:00:20,104 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:00:20,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:00:20,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:00:20,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:00:20,107 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:00:20,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:00:20,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:00:20,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:00:20,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:00:20,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:00:20,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:00:20,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:00:20,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:00:20,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:00:20,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:00:20,115 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:00:20,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:00:20,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:00:20,118 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:00:20,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:00:20,119 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:00:20,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:00:20,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:00:20,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:00:20,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:00:20,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:00:20,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:00:20,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:00:20,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:00:20,123 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:00:20,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:00:20,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:00:20,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:00:20,125 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 13:00:20,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:00:20,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:00:20,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:00:20,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:00:20,137 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:00:20,137 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:00:20,137 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:00:20,138 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:00:20,138 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:00:20,138 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:00:20,138 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:00:20,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:00:20,138 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:00:20,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:00:20,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:00:20,139 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:00:20,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:00:20,139 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:00:20,139 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:00:20,139 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:00:20,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:00:20,140 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:00:20,140 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:00:20,140 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:00:20,140 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:00:20,140 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:00:20,141 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:00:20,141 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:00:20,141 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_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/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 -> 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 [2018-11-10 13:00:20,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:00:20,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:00:20,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:00:20,177 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:00:20,178 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:00:20,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-10 13:00:20,213 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/data/64e7e87a4/64e890ca80c24d79bb7d585cf9dcdfce/FLAGd2ad2c591 [2018-11-10 13:00:20,652 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:00:20,653 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-10 13:00:20,659 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/data/64e7e87a4/64e890ca80c24d79bb7d585cf9dcdfce/FLAGd2ad2c591 [2018-11-10 13:00:20,668 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/bin-2019/uautomizer/data/64e7e87a4/64e890ca80c24d79bb7d585cf9dcdfce [2018-11-10 13:00:20,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:00:20,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:00:20,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:00:20,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:00:20,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:00:20,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:20,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20, skipping insertion in model container [2018-11-10 13:00:20,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:20,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:00:20,713 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:00:20,901 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:00:20,908 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:00:20,938 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:00:20,960 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:00:20,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20 WrapperNode [2018-11-10 13:00:20,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:00:20,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:00:20,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:00:20,962 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:00:21,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:00:21,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:00:21,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:00:21,034 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:00:21,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... [2018-11-10 13:00:21,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:00:21,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:00:21,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:00:21,049 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:00:21,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6eb48b1f-c995-4ee0-af9f-f54aaa572ec0/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-10 13:00:21,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:00:21,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:00:21,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:00:21,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:00:21,302 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:00:21,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:21 BoogieIcfgContainer [2018-11-10 13:00:21,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:00:21,303 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:00:21,303 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:00:21,305 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:00:21,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:00:21,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:00:20" (1/3) ... [2018-11-10 13:00:21,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@558c76cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:00:21, skipping insertion in model container [2018-11-10 13:00:21,306 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:00:21,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:20" (2/3) ... [2018-11-10 13:00:21,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@558c76cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:00:21, skipping insertion in model container [2018-11-10 13:00:21,307 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:00:21,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:21" (3/3) ... [2018-11-10 13:00:21,308 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-10 13:00:21,339 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:00:21,339 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:00:21,339 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:00:21,339 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:00:21,339 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:00:21,339 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:00:21,340 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:00:21,340 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:00:21,340 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:00:21,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 13:00:21,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 13:00:21,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:21,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:21,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:00:21,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:00:21,372 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:00:21,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 13:00:21,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 13:00:21,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:21,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:21,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:00:21,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:00:21,381 INFO L793 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 16#L553true assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 13#L554true SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 21#L558-8true [2018-11-10 13:00:21,382 INFO L795 eck$LassoCheckResult]: Loop: 21#L558-8true assume true; 3#L558true SUMMARY for call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558 6#L558-1true main_#t~short10 := main_#t~mem8 < 100; 10#L558-2true assume !main_#t~short10; 18#L558-6true assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8; 25#L559true SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L559 4#L559-1true SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-1 7#L559-2true SUMMARY for call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4); srcloc: L559-2 11#L559-3true havoc main_#t~mem11;havoc main_#t~mem12; 23#L560true SUMMARY for call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 26#L560-1true SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 5#L560-2true SUMMARY for call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L560-2 8#L560-3true havoc main_#t~mem14;havoc main_#t~mem13; 21#L558-8true [2018-11-10 13:00:21,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2018-11-10 13:00:21,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:21,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:21,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:21,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:21,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1263746743, now seen corresponding path program 1 times [2018-11-10 13:00:21,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:21,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:21,523 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-10 13:00:21,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:00:21,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:00:21,526 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:00:21,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:00:21,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:00:21,537 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-11-10 13:00:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:00:21,553 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-10 13:00:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:00:21,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2018-11-10 13:00:21,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 13:00:21,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 21 transitions. [2018-11-10 13:00:21,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 13:00:21,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 13:00:21,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-10 13:00:21,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:00:21,562 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 13:00:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-10 13:00:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-10 13:00:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 13:00:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-10 13:00:21,580 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 13:00:21,580 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 13:00:21,581 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:00:21,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2018-11-10 13:00:21,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 13:00:21,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:21,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:21,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:00:21,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:00:21,582 INFO L793 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 73#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 74#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 71#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 66#L558-8 [2018-11-10 13:00:21,582 INFO L795 eck$LassoCheckResult]: Loop: 66#L558-8 assume true; 58#L558 SUMMARY for call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558 59#L558-1 main_#t~short10 := main_#t~mem8 < 100; 64#L558-2 assume main_#t~short10; 68#L558-3 SUMMARY for call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-3 70#L558-4 main_#t~short10 := main_#t~mem9 < 100; 72#L558-6 assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8; 76#L559 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L559 60#L559-1 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-1 61#L559-2 SUMMARY for call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4); srcloc: L559-2 65#L559-3 havoc main_#t~mem11;havoc main_#t~mem12; 69#L560 SUMMARY for call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 77#L560-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 62#L560-2 SUMMARY for call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L560-2 63#L560-3 havoc main_#t~mem14;havoc main_#t~mem13; 66#L558-8 [2018-11-10 13:00:21,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 2 times [2018-11-10 13:00:21,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:21,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:21,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1819941466, now seen corresponding path program 1 times [2018-11-10 13:00:21,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:21,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:00:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:21,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash -664117161, now seen corresponding path program 1 times [2018-11-10 13:00:21,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:21,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:21,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:21,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:21,892 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 13:00:22,210 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-11-10 13:00:22,326 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-10 13:00:22,335 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:00:22,336 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:00:22,336 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:00:22,336 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:00:22,336 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:00:22,336 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:00:22,336 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:00:22,336 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:00:22,337 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 13:00:22,337 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:00:22,337 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,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-10 13:00:22,385 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-10 13:00:22,387 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-10 13:00:22,790 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 115 [2018-11-10 13:00:22,893 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-10 13:00:23,324 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:00:23,328 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:00:23,329 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-10 13:00:23,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,334 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-10 13:00:23,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,342 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-10 13:00:23,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,347 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-10 13:00:23,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,349 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-10 13:00:23,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,353 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-10 13:00:23,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,357 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-10 13:00:23,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,362 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-10 13:00:23,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,366 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-10 13:00:23,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,368 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-10 13:00:23,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,370 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-10 13:00:23,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,373 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-10 13:00:23,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,375 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-10 13:00:23,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,379 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-10 13:00:23,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,384 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-10 13:00:23,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:23,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:23,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:23,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,386 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-10 13:00:23,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,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-10 13:00:23,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,398 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-10 13:00:23,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,410 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-10 13:00:23,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,411 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 13:00:23,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,412 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:00:23,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:23,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:23,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:23,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:23,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:23,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:23,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:23,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:23,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:23,443 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:00:23,449 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:00:23,449 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 13:00:23,451 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:00:23,452 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 13:00:23,452 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:00:23,452 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 199 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 1 >= 0] [2018-11-10 13:00:23,572 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-10 13:00:23,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:00:23,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:23,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:23,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:23,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 13:00:23,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:23,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:23,676 INFO L477 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 13 [2018-11-10 13:00:23,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:23,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:23,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:23,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-11-10 13:00:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:23,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:23,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:23,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 65 [2018-11-10 13:00:23,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 57 [2018-11-10 13:00:23,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 13:00:23,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:23,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-10 13:00:23,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:00:23,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-11-10 13:00:24,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-11-10 13:00:24,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:252 [2018-11-10 13:00:24,203 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2018-11-10 13:00:24,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-10 13:00:24,229 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 13:00:24,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:24,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:24,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-11-10 13:00:24,293 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 13:00:24,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:24,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:24,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-11-10 13:00:24,370 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 13:00:24,370 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:24,383 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:24,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-10 13:00:24,436 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:173, output treesize:128 [2018-11-10 13:00:24,462 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-10 13:00:24,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 13:00:24,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 2 Second operand 10 states. [2018-11-10 13:00:24,625 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 2. Second operand 10 states. Result 51 states and 53 transitions. Complement of second has 17 states. [2018-11-10 13:00:24,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 13:00:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 13:00:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-11-10 13:00:24,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 4 letters. Loop has 15 letters. [2018-11-10 13:00:24,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:24,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 19 letters. Loop has 15 letters. [2018-11-10 13:00:24,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:24,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 4 letters. Loop has 30 letters. [2018-11-10 13:00:24,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:24,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 53 transitions. [2018-11-10 13:00:24,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 13:00:24,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 19 states and 19 transitions. [2018-11-10 13:00:24,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 13:00:24,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 13:00:24,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 19 transitions. [2018-11-10 13:00:24,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:00:24,632 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-10 13:00:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 19 transitions. [2018-11-10 13:00:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 13:00:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 13:00:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-10 13:00:24,633 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-10 13:00:24,633 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-10 13:00:24,633 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:00:24,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 19 transitions. [2018-11-10 13:00:24,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 13:00:24,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:00:24,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:00:24,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 13:00:24,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:00:24,635 INFO L793 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 414#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 408#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 405#L558-8 [2018-11-10 13:00:24,635 INFO L795 eck$LassoCheckResult]: Loop: 405#L558-8 assume true; 401#L558 SUMMARY for call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558 402#L558-1 main_#t~short10 := main_#t~mem8 < 100; 406#L558-2 assume main_#t~short10; 409#L558-3 SUMMARY for call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-3 411#L558-4 main_#t~short10 := main_#t~mem9 < 100; 412#L558-6 assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8; 416#L559 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L559 403#L559-1 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-1 404#L559-2 SUMMARY for call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4); srcloc: L559-2 407#L559-3 havoc main_#t~mem11;havoc main_#t~mem12; 410#L560 SUMMARY for call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 417#L560-1 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L560-1 399#L560-2 SUMMARY for call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L560-2 400#L560-3 havoc main_#t~mem14;havoc main_#t~mem13; 405#L558-8 [2018-11-10 13:00:24,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:24,635 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2018-11-10 13:00:24,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:24,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:24,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1819941466, now seen corresponding path program 2 times [2018-11-10 13:00:24,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:24,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:24,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:24,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:00:24,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:24,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:24,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1864209399, now seen corresponding path program 1 times [2018-11-10 13:00:24,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:00:24,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:00:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:24,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:00:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:00:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:00:24,984 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-11-10 13:00:25,063 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:00:25,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:00:25,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:00:25,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:00:25,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:00:25,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:00:25,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:00:25,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:00:25,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 13:00:25,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:00:25,063 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:00:25,066 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-10 13:00:25,068 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-10 13:00:25,069 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-10 13:00:25,372 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2018-11-10 13:00:25,455 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-10 13:00:25,457 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-10 13:00:25,458 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-10 13:00:25,459 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-10 13:00:25,462 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-10 13:00:25,463 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-10 13:00:25,464 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-10 13:00:25,465 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-10 13:00:25,466 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-10 13:00:25,467 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-10 13:00:25,474 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-10 13:00:25,475 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-10 13:00:25,476 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-10 13:00:25,478 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-10 13:00:25,479 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-10 13:00:25,890 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:00:25,890 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:00:25,890 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-10 13:00:25,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:25,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:25,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:25,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:25,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:25,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:25,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:25,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:25,893 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-10 13:00:25,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:25,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:00:25,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:25,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:25,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:25,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:00:25,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:00:25,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:25,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:00:25,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:25,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:25,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:25,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:25,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:25,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:25,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:25,898 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-10 13:00:25,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:25,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:25,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:25,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:25,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:25,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:25,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:25,903 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-10 13:00:25,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:25,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:25,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:25,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:25,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:25,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:25,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:00:25,906 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-10 13:00:25,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:00:25,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:00:25,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:00:25,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:00:25,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:00:25,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:00:25,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:00:25,929 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 13:00:25,929 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 13:00:25,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:00:25,930 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 13:00:25,930 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:00:25,930 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 + 199 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] [2018-11-10 13:00:26,054 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-10 13:00:26,059 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:00:26,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:00:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:26,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:26,087 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:26,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 13:00:26,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:26,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:26,098 INFO L477 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 13 [2018-11-10 13:00:26,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:26,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:26,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:00:26,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-11-10 13:00:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:00:26,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:00:26,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:26,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 79 [2018-11-10 13:00:26,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-11-10 13:00:26,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:00:26,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:26,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 67 [2018-11-10 13:00:26,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-10 13:00:26,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:00:26,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:00:26,370 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:66, output treesize:128 [2018-11-10 13:00:26,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:26,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2018-11-10 13:00:26,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:00:26,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-10 13:00:26,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:00:26,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:00:26,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:00:26,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-10 13:00:26,472 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-10 13:00:26,472 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 13:00:26,472 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 19 transitions. cyclomatic complexity: 1 Second operand 12 states. [2018-11-10 13:00:26,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 19 transitions. cyclomatic complexity: 1. Second operand 12 states. Result 35 states and 36 transitions. Complement of second has 19 states. [2018-11-10 13:00:26,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 13:00:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 13:00:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-11-10 13:00:26,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 4 letters. Loop has 15 letters. [2018-11-10 13:00:26,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:26,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 19 letters. Loop has 15 letters. [2018-11-10 13:00:26,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:26,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 4 letters. Loop has 30 letters. [2018-11-10 13:00:26,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:00:26,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2018-11-10 13:00:26,611 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:00:26,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2018-11-10 13:00:26,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:00:26,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:00:26,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:00:26,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:00:26,612 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:00:26,612 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:00:26,612 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:00:26,612 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:00:26,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:00:26,612 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:00:26,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:00:26,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:00:26 BoogieIcfgContainer [2018-11-10 13:00:26,616 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:00:26,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:00:26,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:00:26,617 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:00:26,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:00:21" (3/4) ... [2018-11-10 13:00:26,619 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:00:26,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:00:26,620 INFO L168 Benchmark]: Toolchain (without parser) took 5949.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:26,621 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:26,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.30 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:26,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:26,622 INFO L168 Benchmark]: Boogie Preprocessor took 14.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:26,622 INFO L168 Benchmark]: RCFGBuilder took 253.40 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:26,622 INFO L168 Benchmark]: BuchiAutomizer took 5313.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.6 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:00:26,623 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:00:26,625 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.30 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 253.40 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5313.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.6 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.4 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 * 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 -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 10 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 11 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 85 SDslu, 47 SDs, 0 SdLazy, 94 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax105 hnf100 lsp89 ukn78 mio100 lsp37 div100 bol100 ite100 ukn100 eq200 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...