./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/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_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/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-5842f4b [2018-11-18 13:18:15,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:18:15,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:18:15,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:18:15,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:18:15,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:18:15,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:18:15,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:18:15,942 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:18:15,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:18:15,943 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:18:15,943 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:18:15,944 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:18:15,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:18:15,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:18:15,946 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:18:15,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:18:15,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:18:15,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:18:15,950 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:18:15,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:18:15,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:18:15,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:18:15,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:18:15,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:18:15,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:18:15,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:18:15,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:18:15,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:18:15,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:18:15,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:18:15,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:18:15,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:18:15,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:18:15,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:18:15,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:18:15,959 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 13:18:15,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:18:15,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:18:15,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:18:15,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:18:15,971 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:18:15,971 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:18:15,971 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:18:15,971 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:18:15,971 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:18:15,971 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:18:15,971 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:18:15,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:18:15,972 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:18:15,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:18:15,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:18:15,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:18:15,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:18:15,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:18:15,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:18:15,973 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:18:15,973 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:18:15,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:18:15,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:18:15,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:18:15,973 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:18:15,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:18:15,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:18:15,974 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:18:15,974 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:18:15,975 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_52001ad5-c131-42a6-94ff-64bced43b5d3/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-18 13:18:15,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:18:16,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:18:16,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:18:16,010 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:18:16,010 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:18:16,010 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-18 13:18:16,053 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/data/993cba068/20dc1e91cc9f4cc49eb34283de7ac238/FLAGb6e2a7035 [2018-11-18 13:18:16,478 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:18:16,478 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-18 13:18:16,486 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/data/993cba068/20dc1e91cc9f4cc49eb34283de7ac238/FLAGb6e2a7035 [2018-11-18 13:18:16,495 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/bin-2019/uautomizer/data/993cba068/20dc1e91cc9f4cc49eb34283de7ac238 [2018-11-18 13:18:16,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:18:16,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:18:16,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:18:16,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:18:16,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:18:16,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c938308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16, skipping insertion in model container [2018-11-18 13:18:16,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:18:16,533 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:18:16,708 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:18:16,714 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:18:16,742 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:18:16,804 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:18:16,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16 WrapperNode [2018-11-18 13:18:16,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:18:16,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:18:16,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:18:16,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:18:16,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:18:16,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:18:16,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:18:16,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:18:16,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... [2018-11-18 13:18:16,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:18:16,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:18:16,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:18:16,847 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:18:16,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52001ad5-c131-42a6-94ff-64bced43b5d3/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-18 13:18:16,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:18:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:18:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:18:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:18:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:18:16,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:18:17,062 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:18:17,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:17 BoogieIcfgContainer [2018-11-18 13:18:17,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:18:17,063 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:18:17,063 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:18:17,066 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:18:17,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:18:17,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:18:16" (1/3) ... [2018-11-18 13:18:17,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b87226d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:18:17, skipping insertion in model container [2018-11-18 13:18:17,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:18:17,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:16" (2/3) ... [2018-11-18 13:18:17,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b87226d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:18:17, skipping insertion in model container [2018-11-18 13:18:17,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:18:17,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:17" (3/3) ... [2018-11-18 13:18:17,070 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-18 13:18:17,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:18:17,119 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:18:17,119 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:18:17,119 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:18:17,119 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:18:17,119 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:18:17,119 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:18:17,120 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:18:17,120 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:18:17,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-18 13:18:17,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:17,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:17,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:17,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 13:18:17,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:18:17,155 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:18:17,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-18 13:18:17,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:17,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:17,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:17,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 13:18:17,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:18:17,162 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#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;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 4#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 5#L558-5true [2018-11-18 13:18:17,162 INFO L796 eck$LassoCheckResult]: Loop: 5#L558-5true assume true; 6#L558true call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 9#L558-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 12#L558-3true assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 5#L558-5true [2018-11-18 13:18:17,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:17,165 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-18 13:18:17,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:17,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:17,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:17,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:17,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:17,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1264235, now seen corresponding path program 1 times [2018-11-18 13:18:17,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:17,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:17,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:17,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:17,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1806873998, now seen corresponding path program 1 times [2018-11-18 13:18:17,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:17,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:17,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:17,497 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 13:18:17,786 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-18 13:18:17,888 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:18:17,889 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:18:17,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:18:17,889 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:18:17,889 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:18:17,889 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:18:17,890 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:18:17,890 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:18:17,890 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 13:18:17,890 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:18:17,890 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:18:17,910 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-18 13:18:17,917 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-18 13:18:17,918 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-18 13:18:17,922 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-18 13:18:17,923 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-18 13:18:17,925 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-18 13:18:17,927 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-18 13:18:17,929 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-18 13:18:17,931 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-18 13:18:17,932 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-18 13:18:17,936 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-18 13:18:17,938 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-18 13:18:17,942 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-18 13:18:17,947 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-18 13:18:17,948 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-18 13:18:17,954 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-18 13:18:18,250 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-18 13:18:18,325 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-18 13:18:18,686 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:18:18,690 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:18:18,692 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-18 13:18:18,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:18,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:18,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:18,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,696 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-18 13:18:18,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:18,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:18,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:18,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:18,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,704 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-18 13:18:18,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,709 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-18 13:18:18,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:18,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:18,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:18,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:18,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,715 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-18 13:18:18,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:18,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:18,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:18,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:18,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:18,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:18,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:18,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,719 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-18 13:18:18,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:18,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:18,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:18,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,721 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-18 13:18:18,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,726 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-18 13:18:18,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:18,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:18,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:18,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,729 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-18 13:18:18,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,733 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-18 13:18:18,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,738 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-18 13:18:18,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:18,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:18,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:18,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,740 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-18 13:18:18,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,745 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-18 13:18:18,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,745 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:18:18,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,746 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:18:18,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,751 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-18 13:18:18,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:18,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:18:18,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:18,791 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-18 13:18:18,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:18,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:18,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:18,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:18,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:18,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:18,803 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:18:18,808 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:18:18,809 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:18:18,810 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:18:18,812 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 13:18:18,812 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:18:18,813 INFO L520 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)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~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-18 13:18:18,942 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-18 13:18:18,953 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:18:18,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:18,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:19,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-18 13:18:19,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:19,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:19,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-11-18 13:18:19,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 35 [2018-11-18 13:18:19,049 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:19,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:19,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:19,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:19,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 13:18:19,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:18:19,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:18:19,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:18:19,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:18:19,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:18:19,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-11-18 13:18:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:19,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:19,124 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-18 13:18:19,133 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 13:18:19,134 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2018-11-18 13:18:19,208 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 29 states and 36 transitions. Complement of second has 9 states. [2018-11-18 13:18:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:18:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:18:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-18 13:18:19,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 13:18:19,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:19,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 13:18:19,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:19,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 13:18:19,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:19,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-11-18 13:18:19,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:19,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 7 states and 8 transitions. [2018-11-18 13:18:19,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 13:18:19,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-18 13:18:19,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-18 13:18:19,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:18:19,219 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-18 13:18:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-18 13:18:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-18 13:18:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 13:18:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-18 13:18:19,235 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-18 13:18:19,235 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-18 13:18:19,235 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:18:19,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-18 13:18:19,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:18:19,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:18:19,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:18:19,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 13:18:19,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:18:19,236 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#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;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 258#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 259#L558-5 [2018-11-18 13:18:19,236 INFO L796 eck$LassoCheckResult]: Loop: 259#L558-5 assume true; 260#L558 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 261#L558-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 263#L558-3 assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 259#L558-5 [2018-11-18 13:18:19,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-18 13:18:19,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:19,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:19,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1264235, now seen corresponding path program 2 times [2018-11-18 13:18:19,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:19,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:19,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:19,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:19,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1805026956, now seen corresponding path program 1 times [2018-11-18 13:18:19,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:18:19,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:18:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:19,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:18:19,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:18:19,533 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-18 13:18:19,615 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:18:19,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:18:19,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:18:19,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:18:19,615 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:18:19,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:18:19,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:18:19,615 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:18:19,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 13:18:19,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:18:19,616 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:18:19,619 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-18 13:18:19,625 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-18 13:18:19,626 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-18 13:18:19,815 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2018-11-18 13:18:19,890 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-18 13:18:19,891 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-18 13:18:19,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-18 13:18:19,894 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-18 13:18:19,895 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-18 13:18:19,897 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-18 13:18:19,899 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-18 13:18:19,900 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-18 13:18:19,901 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-18 13:18:19,902 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-18 13:18:19,903 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-18 13:18:19,904 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-18 13:18:19,907 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-18 13:18:19,910 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-18 13:18:19,911 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-18 13:18:20,230 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:18:20,230 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:18:20,230 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-18 13:18:20,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:20,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:20,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:20,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:20,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:20,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:20,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:20,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:20,232 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-18 13:18:20,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:20,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:18:20,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:20,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:20,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:20,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:18:20,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:18:20,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:20,239 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-18 13:18:20,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:20,239 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:18:20,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:20,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:20,241 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:18:20,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:20,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:20,247 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-18 13:18:20,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:20,247 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:18:20,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:20,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:20,250 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:18:20,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:20,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:20,252 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-18 13:18:20,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:20,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:20,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:20,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:20,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:20,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:20,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:18:20,256 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-18 13:18:20,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:18:20,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:18:20,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:18:20,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:18:20,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:18:20,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:18:20,265 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:18:20,268 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:18:20,268 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:18:20,268 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:18:20,269 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 13:18:20,269 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:18:20,269 INFO L520 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)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~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-18 13:18:20,380 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-18 13:18:20,385 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:18:20,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:20,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:20,415 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-18 13:18:20,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:20,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:20,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-11-18 13:18:20,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 35 [2018-11-18 13:18:20,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:20,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:20,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:20,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:18:20,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 13:18:20,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:18:20,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:18:20,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:18:20,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:18:20,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:18:20,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-11-18 13:18:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:20,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:18:20,528 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-18 13:18:20,529 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 13:18:20,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-18 13:18:20,572 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 13 states and 15 transitions. Complement of second has 9 states. [2018-11-18 13:18:20,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 13:18:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 13:18:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-11-18 13:18:20,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 13:18:20,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:20,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 13:18:20,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:20,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 13:18:20,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:18:20,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-18 13:18:20,574 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:18:20,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2018-11-18 13:18:20,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:18:20,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:18:20,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:18:20,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:18:20,575 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:18:20,575 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:18:20,575 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:18:20,575 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:18:20,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:18:20,575 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:18:20,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:18:20,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:18:20 BoogieIcfgContainer [2018-11-18 13:18:20,579 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:18:20,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:18:20,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:18:20,580 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:18:20,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:17" (3/4) ... [2018-11-18 13:18:20,582 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:18:20,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:18:20,583 INFO L168 Benchmark]: Toolchain (without parser) took 4085.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -254.6 MB). Peak memory consumption was 74.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:20,583 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:18:20,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -198.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:20,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:20,584 INFO L168 Benchmark]: Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:20,585 INFO L168 Benchmark]: RCFGBuilder took 215.96 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:20,585 INFO L168 Benchmark]: BuchiAutomizer took 3515.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.8 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:18:20,585 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:18:20,588 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -198.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 215.96 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3515.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.8 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 6 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 25 SDslu, 9 SDs, 0 SdLazy, 30 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax105 hnf100 lsp89 ukn55 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 VariablesLoop: 0 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...