./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/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 3cca4963db77635bc2da65f99e90064d806437e6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:45:15,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:45:15,778 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:45:15,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:45:15,786 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:45:15,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:45:15,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:45:15,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:45:15,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:45:15,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:45:15,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:45:15,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:45:15,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:45:15,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:45:15,794 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:45:15,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:45:15,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:45:15,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:45:15,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:45:15,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:45:15,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:45:15,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:45:15,802 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:45:15,803 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:45:15,803 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:45:15,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:45:15,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:45:15,805 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:45:15,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:45:15,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:45:15,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:45:15,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:45:15,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:45:15,807 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:45:15,808 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:45:15,808 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:45:15,809 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:45:15,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:45:15,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:45:15,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:45:15,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:45:15,822 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:45:15,822 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:45:15,822 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:45:15,822 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:45:15,823 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:45:15,823 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:45:15,823 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:45:15,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:45:15,823 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:45:15,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:45:15,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:45:15,823 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:45:15,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:45:15,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:45:15,824 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:45:15,824 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:45:15,829 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:45:15,829 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:45:15,829 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:45:15,829 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:45:15,829 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:45:15,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:45:15,829 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:45:15,829 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:45:15,830 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:45:15,830 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_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/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 -> 3cca4963db77635bc2da65f99e90064d806437e6 [2018-11-28 11:45:15,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:45:15,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:45:15,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:45:15,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:45:15,871 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:45:15,871 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-28 11:45:15,921 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/data/0beaa8701/55a32df506a34c8d905fc3a124f74eca/FLAGca19b756c [2018-11-28 11:45:16,320 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:45:16,321 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-28 11:45:16,330 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/data/0beaa8701/55a32df506a34c8d905fc3a124f74eca/FLAGca19b756c [2018-11-28 11:45:16,691 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/bin-2019/uautomizer/data/0beaa8701/55a32df506a34c8d905fc3a124f74eca [2018-11-28 11:45:16,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:45:16,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:45:16,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:45:16,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:45:16,698 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:45:16,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:45:16" (1/1) ... [2018-11-28 11:45:16,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6022eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:16, skipping insertion in model container [2018-11-28 11:45:16,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:45:16" (1/1) ... [2018-11-28 11:45:16,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:45:16,729 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:45:16,917 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:45:16,927 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:45:17,012 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:45:17,038 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:45:17,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17 WrapperNode [2018-11-28 11:45:17,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:45:17,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:45:17,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:45:17,039 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:45:17,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:45:17,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:45:17,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:45:17,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:45:17,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... [2018-11-28 11:45:17,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:45:17,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:45:17,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:45:17,089 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:45:17,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8b06167-fac0-4a98-89b7-cdfdedd3c71f/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-28 11:45:17,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:45:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:45:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:45:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:45:17,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:45:17,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:45:17,311 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:45:17,311 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 11:45:17,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:45:17 BoogieIcfgContainer [2018-11-28 11:45:17,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:45:17,312 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:45:17,312 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:45:17,315 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:45:17,316 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:45:17,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:45:16" (1/3) ... [2018-11-28 11:45:17,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fd841b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:45:17, skipping insertion in model container [2018-11-28 11:45:17,317 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:45:17,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:45:17" (2/3) ... [2018-11-28 11:45:17,318 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fd841b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:45:17, skipping insertion in model container [2018-11-28 11:45:17,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:45:17,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:45:17" (3/3) ... [2018-11-28 11:45:17,320 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-28 11:45:17,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:45:17,361 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:45:17,361 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:45:17,361 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:45:17,361 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:45:17,361 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:45:17,361 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:45:17,362 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:45:17,362 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:45:17,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 11:45:17,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:45:17,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:45:17,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:45:17,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:45:17,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:45:17,394 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:45:17,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 11:45:17,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:45:17,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:45:17,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:45:17,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:45:17,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:45:17,401 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 11#L554-2true [2018-11-28 11:45:17,402 INFO L796 eck$LassoCheckResult]: Loop: 11#L554-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 14#L551-1true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3#L551-3true main_#t~short9 := main_#t~short7; 5#L551-4true assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6#L551-6true assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 12#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 11#L554-2true [2018-11-28 11:45:17,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:17,406 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:45:17,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:17,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:17,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:17,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:17,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-11-28 11:45:17,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:17,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:17,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:17,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:17,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:17,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-11-28 11:45:17,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:17,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:17,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:17,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:17,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:17,733 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-11-28 11:45:17,926 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:45:17,926 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:45:17,927 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:45:17,927 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:45:17,927 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:45:17,927 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:45:17,927 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:45:17,927 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:45:17,928 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 11:45:17,928 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:45:17,928 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:45:17,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,247 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-11-28 11:45:18,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:18,645 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:45:18,649 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:45:18,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:18,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:18,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:18,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:18,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:18,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:18,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:18,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:18,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:18,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:18,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:18,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:18,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:18,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:18,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:18,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45: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-28 11:45:18,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:18,716 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:45:18,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:18,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:18,718 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:45:18,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:18,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45: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-28 11:45:18,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:18,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:18,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:18,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:18,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:18,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:18,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:18,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:18,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:18,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:18,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:18,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:18,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:18,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:18,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:18,741 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:45:18,745 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:45:18,745 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:45:18,747 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:45:18,747 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:45:18,748 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:45:18,748 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-28 11:45:18,829 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:45:18,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:45:18,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:18,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:18,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:18,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:45:18,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-28 11:45:19,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2018-11-28 11:45:19,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:45:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:45:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-28 11:45:19,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 11:45:19,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:19,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 11:45:19,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:19,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 11:45:19,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:19,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-11-28 11:45:19,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 11:45:19,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 50 transitions. [2018-11-28 11:45:19,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 11:45:19,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 11:45:19,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2018-11-28 11:45:19,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:45:19,033 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-11-28 11:45:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2018-11-28 11:45:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-28 11:45:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 11:45:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-11-28 11:45:19,053 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-28 11:45:19,053 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-28 11:45:19,053 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:45:19,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-11-28 11:45:19,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 11:45:19,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:45:19,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:45:19,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:45:19,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:45:19,055 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 226#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2018-11-28 11:45:19,055 INFO L796 eck$LassoCheckResult]: Loop: 246#L551-1 assume !main_#t~short7; 227#L551-3 main_#t~short9 := main_#t~short7; 228#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 232#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 242#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 247#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2018-11-28 11:45:19,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 11:45:19,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:19,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:19,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2018-11-28 11:45:19,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:19,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:19,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:45:19,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:45:19,102 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:45:19,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:45:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:45:19,104 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-28 11:45:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:45:19,126 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-28 11:45:19,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:45:19,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-11-28 11:45:19,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:45:19,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2018-11-28 11:45:19,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 11:45:19,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 11:45:19,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-11-28 11:45:19,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:45:19,129 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 11:45:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-11-28 11:45:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 11:45:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 11:45:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 11:45:19,131 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 11:45:19,131 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 11:45:19,131 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:45:19,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-28 11:45:19,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 11:45:19,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:45:19,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:45:19,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:45:19,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:45:19,133 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 303#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 311#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 318#L551-3 main_#t~short9 := main_#t~short7; 317#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 316#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 312#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2018-11-28 11:45:19,133 INFO L796 eck$LassoCheckResult]: Loop: 313#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 307#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 308#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 298#L551-3 main_#t~short9 := main_#t~short7; 299#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 304#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 315#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2018-11-28 11:45:19,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-11-28 11:45:19,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:19,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:19,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1175734219, now seen corresponding path program 1 times [2018-11-28 11:45:19,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:19,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:19,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:19,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1517982238, now seen corresponding path program 1 times [2018-11-28 11:45:19,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:19,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:19,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:19,364 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-11-28 11:45:19,574 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2018-11-28 11:45:19,630 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:45:19,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:45:19,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:45:19,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:45:19,630 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:45:19,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:45:19,630 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:45:19,630 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:45:19,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 11:45:19,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:45:19,631 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:45:19,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:19,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:20,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:45:20,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:45:20,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:20,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:20,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:20,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:20,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:20,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:20,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:20,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:20,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:20,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:20,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:20,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:20,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:20,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:20,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:20,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:20,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:20,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:20,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:20,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:20,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:20,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:20,127 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:45:20,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:20,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:45:20,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:20,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:20,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:20,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:20,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:20,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:20,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:20,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:20,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:20,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:20,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:20,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:20,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:20,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:20,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:20,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:20,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:20,138 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:45:20,142 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:45:20,143 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:45:20,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:45:20,144 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:45:20,144 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:45:20,145 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-11-28 11:45:20,186 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:45:20,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:45:20,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:20,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:20,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:45:20,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:20,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:20,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:45:20,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:20,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:20,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:20,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:45:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:20,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:20,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:20,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:45:20,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:20,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:45:20,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:20,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:45:20,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:45:20,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:20,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:20,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:20,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:20,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-28 11:45:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:20,360 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 11:45:20,360 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 11:45:20,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 48 states and 58 transitions. Complement of second has 12 states. [2018-11-28 11:45:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:45:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:45:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-28 11:45:20,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 7 letters. [2018-11-28 11:45:20,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:20,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-28 11:45:20,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:20,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 14 letters. [2018-11-28 11:45:20,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:20,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2018-11-28 11:45:20,466 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 11:45:20,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 52 transitions. [2018-11-28 11:45:20,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 11:45:20,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 11:45:20,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2018-11-28 11:45:20,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:45:20,467 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-28 11:45:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2018-11-28 11:45:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-28 11:45:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 11:45:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-28 11:45:20,470 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-28 11:45:20,470 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-28 11:45:20,470 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:45:20,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2018-11-28 11:45:20,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 11:45:20,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:45:20,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:45:20,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:45:20,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:45:20,472 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 553#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 554#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 577#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 582#L551-3 main_#t~short9 := main_#t~short7; 581#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 580#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 579#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 578#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 559#L554-2 [2018-11-28 11:45:20,473 INFO L796 eck$LassoCheckResult]: Loop: 559#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 563#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 549#L551-3 main_#t~short9 := main_#t~short7; 550#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 555#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 558#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 559#L554-2 [2018-11-28 11:45:20,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450581, now seen corresponding path program 1 times [2018-11-28 11:45:20,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:20,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:20,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:20,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:20,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:20,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-11-28 11:45:20,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:20,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:20,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:20,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:20,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1001977698, now seen corresponding path program 1 times [2018-11-28 11:45:20,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:20,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:20,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:20,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:45:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:20,796 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2018-11-28 11:45:20,837 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:45:20,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:45:20,838 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:45:20,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:45:20,838 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:45:20,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:45:20,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:45:20,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:45:20,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 11:45:20,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:45:20,838 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:45:20,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:20,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:20,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:21,289 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:45:21,289 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:45:21,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:21,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:21,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:21,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:21,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:21,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,299 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:45:21,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,300 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:45:21,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:21,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:21,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:21,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:21,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,320 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:45:21,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,321 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:45:21,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:21,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:21,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:21,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:21,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:21,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:21,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:21,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:21,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:21,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:21,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:21,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:45:21,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:45:21,334 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:45:21,334 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:45:21,334 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:45:21,335 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:45:21,335 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-28 11:45:21,396 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:45:21,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:45:21,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:21,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:21,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:21,444 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:45:21,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 11:45:21,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 55 states and 66 transitions. Complement of second has 7 states. [2018-11-28 11:45:21,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:45:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:45:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 11:45:21,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:45:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:21,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 11:45:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:21,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-28 11:45:21,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:21,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. [2018-11-28 11:45:21,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 11:45:21,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 65 transitions. [2018-11-28 11:45:21,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 11:45:21,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 11:45:21,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2018-11-28 11:45:21,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:45:21,470 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-28 11:45:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2018-11-28 11:45:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-28 11:45:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 11:45:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-28 11:45:21,472 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-28 11:45:21,472 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-28 11:45:21,472 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:45:21,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2018-11-28 11:45:21,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 11:45:21,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:45:21,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:45:21,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 11:45:21,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:45:21,477 INFO L794 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 815#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 816#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 845#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 844#L551-3 main_#t~short9 := main_#t~short7; 843#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 842#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 841#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 840#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 831#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 838#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 837#L551-3 main_#t~short9 := main_#t~short7; 835#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 836#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 848#L552 [2018-11-28 11:45:21,477 INFO L796 eck$LassoCheckResult]: Loop: 848#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 849#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 858#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 855#L551-3 main_#t~short9 := main_#t~short7; 854#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 851#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 848#L552 [2018-11-28 11:45:21,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 48967168, now seen corresponding path program 2 times [2018-11-28 11:45:21,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:21,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:21,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:21,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:21,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1695896472, now seen corresponding path program 3 times [2018-11-28 11:45:21,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:21,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:21,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:45:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:21,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1971308119, now seen corresponding path program 1 times [2018-11-28 11:45:21,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:21,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:21,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:45:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:21,964 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 108 [2018-11-28 11:45:22,028 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:45:22,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:45:22,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:45:22,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:45:22,028 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:45:22,028 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:45:22,028 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:45:22,028 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:45:22,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 11:45:22,028 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:45:22,028 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:45:22,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,201 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-11-28 11:45:22,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:22,493 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:45:22,493 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:45:22,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:22,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:22,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:22,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:22,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:22,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:22,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:22,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:22,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:22,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:22,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:22,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:22,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:22,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:22,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:22,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:22,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:22,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:22,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:22,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:22,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:22,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:45:22,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,522 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:45:22,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:22,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:22,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:22,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:22,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:22,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:22,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:22,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:22,552 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:45:22,555 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:45:22,555 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:45:22,555 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:45:22,556 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:45:22,556 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:45:22,556 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2018-11-28 11:45:22,605 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:45:22,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:45:22,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:22,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:22,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:22,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:22,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 11:45:22,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:22,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:45:22,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-28 11:45:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:22,673 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 11:45:22,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-28 11:45:22,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 74 states and 87 transitions. Complement of second has 9 states. [2018-11-28 11:45:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:45:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:45:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 11:45:22,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:45:22,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:22,696 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:45:22,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:22,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:22,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:22,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:22,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 11:45:22,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:22,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:45:22,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-28 11:45:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:22,756 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 11:45:22,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-28 11:45:22,781 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 72 states and 83 transitions. Complement of second has 11 states. [2018-11-28 11:45:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:45:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:45:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-28 11:45:22,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:45:22,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:22,783 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:45:22,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:22,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:22,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:22,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:22,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 11:45:22,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:22,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:45:22,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:22,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-28 11:45:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:22,846 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 11:45:22,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-28 11:45:22,869 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 118 states and 142 transitions. Complement of second has 10 states. [2018-11-28 11:45:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:45:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:45:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-28 11:45:22,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:45:22,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:22,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-28 11:45:22,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:22,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-28 11:45:22,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:22,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 142 transitions. [2018-11-28 11:45:22,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-28 11:45:22,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 90 states and 103 transitions. [2018-11-28 11:45:22,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-28 11:45:22,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-28 11:45:22,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 103 transitions. [2018-11-28 11:45:22,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:45:22,875 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 103 transitions. [2018-11-28 11:45:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 103 transitions. [2018-11-28 11:45:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-11-28 11:45:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 11:45:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-11-28 11:45:22,879 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-28 11:45:22,879 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-11-28 11:45:22,879 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:45:22,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2018-11-28 11:45:22,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-28 11:45:22,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:45:22,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:45:22,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:45:22,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-11-28 11:45:22,881 INFO L794 eck$LassoCheckResult]: Stem: 1473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1469#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 1470#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1498#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1494#L551-3 main_#t~short9 := main_#t~short7; 1491#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1489#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1486#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1487#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 1474#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1476#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1465#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2018-11-28 11:45:22,881 INFO L796 eck$LassoCheckResult]: Loop: 1466#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1471#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1479#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1480#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 1504#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1526#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1525#L551-3 main_#t~short9 := main_#t~short7; 1524#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1523#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1522#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 1477#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1478#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1531#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2018-11-28 11:45:22,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash -285922666, now seen corresponding path program 2 times [2018-11-28 11:45:22,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:22,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:22,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:22,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:22,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:22,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1998556810, now seen corresponding path program 1 times [2018-11-28 11:45:22,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:22,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:22,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:45:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:22,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:22,919 INFO L82 PathProgramCache]: Analyzing trace with hash 691396865, now seen corresponding path program 1 times [2018-11-28 11:45:22,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:22,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:22,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:23,182 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-11-28 11:45:23,497 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 105 [2018-11-28 11:45:23,575 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:45:23,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:45:23,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:45:23,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:45:23,576 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:45:23,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:45:23,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:45:23,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:45:23,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 11:45:23,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:45:23,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:45:23,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:23,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:45:24,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:45:24,045 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:45:24,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:24,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:24,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:24,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:24,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:24,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:24,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:24,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,054 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:45:24,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,054 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:45:24,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:24,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:24,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:24,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:24,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:24,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:24,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:24,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:24,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:24,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:24,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:45:24,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:45:24,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:45:24,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,063 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:45:24,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,063 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:45:24,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,067 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:45:24,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,067 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:45:24,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:24,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:24,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:24,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:24,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,094 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:45:24,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,095 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:45:24,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:45:24,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:45:24,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:45:24,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:45:24,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:45:24,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:45:24,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:45:24,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:45:24,109 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:45:24,116 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:45:24,116 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:45:24,117 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:45:24,117 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-28 11:45:24,118 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:45:24,118 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem5) = 1*ULTIMATE.start_main_#t~mem5 Supporting invariants [1*ULTIMATE.start_main_#t~mem5 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 >= 0, 2*ULTIMATE.start_main_#t~mem5 - 1 >= 0] [2018-11-28 11:45:24,205 INFO L297 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2018-11-28 11:45:24,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:24,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:24,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:45:24,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:45:24,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 11:45:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:24,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:24,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-28 11:45:24,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-28 11:45:24,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2018-11-28 11:45:24,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 11:45:24,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-28 11:45:24,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:45:24,419 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,424 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:45:24,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:45:24,430 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,435 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 11:45:24,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:45:24,465 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,469 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:45:24,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:45:24,510 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-11-28 11:45:24,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 11:45:24,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:45:24,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-11-28 11:45:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:45:24,557 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2018-11-28 11:45:24,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-28 11:45:24,616 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 109 states and 129 transitions. Complement of second has 13 states. [2018-11-28 11:45:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:45:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 11:45:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-28 11:45:24,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 12 letters. Loop has 13 letters. [2018-11-28 11:45:24,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:45:24,618 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:45:24,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:24,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:24,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:45:24,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:45:24,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 11:45:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:24,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:24,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-28 11:45:24,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-11-28 11:45:24,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 11:45:24,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:24,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-11-28 11:45:24,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 11:45:24,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:45:24,791 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-28 11:45:24,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:45:24,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,857 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:45:24,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:45:24,864 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,870 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:24,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:45:24,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:45:24,914 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-11-28 11:45:25,067 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-28 11:45:25,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:25,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-28 11:45:25,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:25,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:45:25,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:25,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:25,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:25,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2018-11-28 11:45:25,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:25,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-11-28 11:45:25,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:25,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:25,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-11-28 11:45:25,324 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:25,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:25,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:25,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2018-11-28 11:45:25,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:25,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-28 11:45:25,366 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:25,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:25,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 11:45:25,383 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:25,393 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:45:25,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-28 11:45:25,412 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:93 [2018-11-28 11:45:25,705 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-28 11:45:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:25,760 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 9 loop predicates [2018-11-28 11:45:25,760 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 12 states. [2018-11-28 11:46:26,401 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-11-28 11:46:26,609 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2018-11-28 11:46:50,783 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 12 states. Result 122 states and 143 transitions. Complement of second has 21 states. [2018-11-28 11:46:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 3 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-28 11:46:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:46:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-11-28 11:46:50,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. Stem has 12 letters. Loop has 13 letters. [2018-11-28 11:46:50,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:46:50,785 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:46:50,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:50,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:46:50,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:50,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:46:50,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:50,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:50,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:46:50,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:50,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:46:50,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:46:50,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 11:46:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:50,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:46:50,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:50,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-28 11:46:50,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:50,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-11-28 11:46:50,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 11:46:50,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:50,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-11-28 11:46:50,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 11:46:51,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:46:51,022 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,027 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-28 11:46:51,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:46:51,062 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:46:51,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:46:51,074 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,081 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:46:51,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:46:51,127 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-11-28 11:46:51,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:51,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-28 11:46:51,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:51,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:46:51,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:51,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2018-11-28 11:46:51,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:51,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-11-28 11:46:51,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:51,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-11-28 11:46:51,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:51,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2018-11-28 11:46:51,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:51,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-28 11:46:51,547 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:46:51,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 11:46:51,572 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:46:51,584 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:46:51,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-28 11:46:51,607 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:93 [2018-11-28 11:46:51,905 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-28 11:46:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:46:51,968 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 9 loop predicates [2018-11-28 11:46:51,968 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 12 states. [2018-11-28 11:47:54,095 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-11-28 11:47:54,273 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-11-28 11:48:44,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 12 states. Result 355 states and 415 transitions. Complement of second has 44 states. [2018-11-28 11:48:44,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 3 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-28 11:48:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 11:48:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-11-28 11:48:44,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 29 transitions. Stem has 12 letters. Loop has 13 letters. [2018-11-28 11:48:44,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:44,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 29 transitions. Stem has 25 letters. Loop has 13 letters. [2018-11-28 11:48:44,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:44,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 29 transitions. Stem has 12 letters. Loop has 26 letters. [2018-11-28 11:48:44,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:44,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 355 states and 415 transitions. [2018-11-28 11:48:44,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-28 11:48:44,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 355 states to 244 states and 282 transitions. [2018-11-28 11:48:44,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-28 11:48:44,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-28 11:48:44,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 282 transitions. [2018-11-28 11:48:44,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:48:44,606 INFO L705 BuchiCegarLoop]: Abstraction has 244 states and 282 transitions. [2018-11-28 11:48:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 282 transitions. [2018-11-28 11:48:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 157. [2018-11-28 11:48:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-28 11:48:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2018-11-28 11:48:44,615 INFO L728 BuchiCegarLoop]: Abstraction has 157 states and 190 transitions. [2018-11-28 11:48:44,615 INFO L608 BuchiCegarLoop]: Abstraction has 157 states and 190 transitions. [2018-11-28 11:48:44,615 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:48:44,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 190 transitions. [2018-11-28 11:48:44,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-28 11:48:44,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:48:44,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:48:44,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 11:48:44,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:48:44,621 INFO L794 eck$LassoCheckResult]: Stem: 2618#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2614#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 2615#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2691#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2766#L551-3 main_#t~short9 := main_#t~short7; 2765#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2647#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 2643#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2644#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2703#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2704#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2759#L551-3 main_#t~short9 := main_#t~short7; 2758#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2616#L551-6 [2018-11-28 11:48:44,621 INFO L796 eck$LassoCheckResult]: Loop: 2616#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 2634#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2630#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 2620#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2623#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2610#L551-3 main_#t~short9 := main_#t~short7; 2611#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2616#L551-6 [2018-11-28 11:48:44,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash -273668037, now seen corresponding path program 3 times [2018-11-28 11:48:44,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:44,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:44,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:48:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:44,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash -949832095, now seen corresponding path program 2 times [2018-11-28 11:48:44,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:44,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:44,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:44,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:48:44,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:44,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1984317209, now seen corresponding path program 1 times [2018-11-28 11:48:44,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:44,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:44,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:48:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:44,825 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2018-11-28 11:48:44,930 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-28 11:48:45,279 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 116 [2018-11-28 11:48:45,750 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 97 [2018-11-28 11:48:45,752 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:48:45,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:48:45,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:48:45,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:48:45,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:48:45,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:48:45,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:48:45,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:48:45,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-28 11:48:45,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:48:45,753 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:48:45,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:45,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:46,138 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2018-11-28 11:48:46,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:46,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:46,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:48:46,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:48:46,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:46,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:46,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:46,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:46,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:46,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:46,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:46,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:46,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:46,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:46,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:46,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:46,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:46,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,583 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:48:46,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,583 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:48:46,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:46,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:46,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:46,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:46,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,593 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:48:46,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,594 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:48:46,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,597 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:48:46,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,598 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:48:46,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,623 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:48:46,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,624 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:48:46,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:46,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:46,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:46,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:46,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:46,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:46,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:46,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:46,638 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:48:46,640 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:48:46,640 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:48:46,640 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:48:46,641 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:48:46,642 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:48:46,642 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)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-28 11:48:46,755 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:48:46,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:48:46,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:46,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:46,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:48:46,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:46,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:46,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:48:46,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:46,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:46,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:46,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:48:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:46,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:46,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:46,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:48:46,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:46,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:48:46,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:46,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:48:46,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:46,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:46,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:46,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:46,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:46,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-28 11:48:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:48:46,906 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:48:46,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 190 transitions. cyclomatic complexity: 39 Second operand 7 states. [2018-11-28 11:48:46,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 190 transitions. cyclomatic complexity: 39. Second operand 7 states. Result 302 states and 365 transitions. Complement of second has 12 states. [2018-11-28 11:48:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:48:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:48:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-28 11:48:46,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-28 11:48:46,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:46,976 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:48:46,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:47,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:47,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:48:47,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:47,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:47,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:48:47,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:48:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:47,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:47,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:47,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:48:47,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:47,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:48:47,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:48:47,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:47,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-28 11:48:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:48:47,095 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:48:47,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 190 transitions. cyclomatic complexity: 39 Second operand 7 states. [2018-11-28 11:48:47,161 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 190 transitions. cyclomatic complexity: 39. Second operand 7 states. Result 302 states and 365 transitions. Complement of second has 12 states. [2018-11-28 11:48:47,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:48:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:48:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-28 11:48:47,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-28 11:48:47,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:47,162 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:48:47,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:47,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:47,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:48:47,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:47,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:47,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:48:47,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:48:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:47,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:47,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:47,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:48:47,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:47,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:48:47,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:48:47,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:47,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:47,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-28 11:48:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:48:47,292 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:48:47,292 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 190 transitions. cyclomatic complexity: 39 Second operand 7 states. [2018-11-28 11:48:47,379 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 190 transitions. cyclomatic complexity: 39. Second operand 7 states. Result 387 states and 474 transitions. Complement of second has 13 states. [2018-11-28 11:48:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:48:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:48:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-28 11:48:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-28 11:48:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-28 11:48:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-28 11:48:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:47,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 474 transitions. [2018-11-28 11:48:47,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2018-11-28 11:48:47,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 297 states and 358 transitions. [2018-11-28 11:48:47,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-28 11:48:47,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2018-11-28 11:48:47,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 358 transitions. [2018-11-28 11:48:47,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:48:47,387 INFO L705 BuchiCegarLoop]: Abstraction has 297 states and 358 transitions. [2018-11-28 11:48:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 358 transitions. [2018-11-28 11:48:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 230. [2018-11-28 11:48:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-28 11:48:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 284 transitions. [2018-11-28 11:48:47,395 INFO L728 BuchiCegarLoop]: Abstraction has 230 states and 284 transitions. [2018-11-28 11:48:47,395 INFO L608 BuchiCegarLoop]: Abstraction has 230 states and 284 transitions. [2018-11-28 11:48:47,395 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:48:47,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 284 transitions. [2018-11-28 11:48:47,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-28 11:48:47,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:48:47,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:48:47,397 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 11:48:47,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-11-28 11:48:47,397 INFO L794 eck$LassoCheckResult]: Stem: 4128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4123#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 4124#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4286#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4325#L551-3 main_#t~short9 := main_#t~short7; 4324#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4323#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 4136#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4140#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 4141#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4180#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4170#L551-3 main_#t~short9 := main_#t~short7; 4163#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4164#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 4154#L552 [2018-11-28 11:48:47,398 INFO L796 eck$LassoCheckResult]: Loop: 4154#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4146#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 4153#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4152#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4151#L551-3 main_#t~short9 := main_#t~short7; 4149#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4147#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 4144#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 4145#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4188#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4174#L551-3 main_#t~short9 := main_#t~short7; 4167#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4155#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 4154#L552 [2018-11-28 11:48:47,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash 106225470, now seen corresponding path program 4 times [2018-11-28 11:48:47,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:47,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:47,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:48:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:47,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -604084796, now seen corresponding path program 1 times [2018-11-28 11:48:47,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:47,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:47,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:47,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:48:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:47,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1029377625, now seen corresponding path program 2 times [2018-11-28 11:48:47,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:47,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:47,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:48:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:47,736 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 90 [2018-11-28 11:48:48,121 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 110 [2018-11-28 11:48:48,184 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:48:48,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:48:48,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:48:48,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:48:48,184 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:48:48,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:48:48,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:48:48,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:48:48,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-28 11:48:48,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:48:48,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:48:48,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:48,687 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:48:48,688 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:48:48,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:48,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:48,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:48,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:48,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:48,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:48,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:48,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:48,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:48,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:48,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:48,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:48,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:48,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:48,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:48,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:48,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:48,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:48,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:48,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:48,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:48,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:48,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:48,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:48,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,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-28 11:48:48,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:48,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:48,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:48,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:48,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:48,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:48,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:48,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:48,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:48,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:48,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:48,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:48,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:48,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:48,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:48,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:48,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:48,719 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:48:48,720 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:48:48,720 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:48:48,721 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:48:48,721 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:48:48,722 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:48:48,722 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)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_7 Supporting invariants [] [2018-11-28 11:48:48,857 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:48:48,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:48:48,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:48,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:48,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:48,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:48:48,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:48,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:48,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:48:48,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:48,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:48,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:48,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 11:48:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:48,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:48,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:48,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:48:48,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:48,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:48:48,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:48,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:48:48,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:48,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:48,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:48,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:49,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:49,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:14 [2018-11-28 11:48:49,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:49,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 11:48:49,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:49,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:49,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:49,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:49,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:49,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-11-28 11:48:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:48:49,056 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:48:49,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 230 states and 284 transitions. cyclomatic complexity: 63 Second operand 7 states. [2018-11-28 11:48:49,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 230 states and 284 transitions. cyclomatic complexity: 63. Second operand 7 states. Result 540 states and 649 transitions. Complement of second has 10 states. [2018-11-28 11:48:49,116 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-28 11:48:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:48:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-28 11:48:49,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 14 letters. Loop has 13 letters. [2018-11-28 11:48:49,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:49,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 27 letters. Loop has 13 letters. [2018-11-28 11:48:49,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:49,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 14 letters. Loop has 26 letters. [2018-11-28 11:48:49,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:49,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 540 states and 649 transitions. [2018-11-28 11:48:49,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-28 11:48:49,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 540 states to 376 states and 455 transitions. [2018-11-28 11:48:49,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-28 11:48:49,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-28 11:48:49,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 376 states and 455 transitions. [2018-11-28 11:48:49,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:48:49,123 INFO L705 BuchiCegarLoop]: Abstraction has 376 states and 455 transitions. [2018-11-28 11:48:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 455 transitions. [2018-11-28 11:48:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 294. [2018-11-28 11:48:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-28 11:48:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 362 transitions. [2018-11-28 11:48:49,131 INFO L728 BuchiCegarLoop]: Abstraction has 294 states and 362 transitions. [2018-11-28 11:48:49,131 INFO L608 BuchiCegarLoop]: Abstraction has 294 states and 362 transitions. [2018-11-28 11:48:49,131 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:48:49,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 362 transitions. [2018-11-28 11:48:49,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-28 11:48:49,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:48:49,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:48:49,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-11-28 11:48:49,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 1, 1] [2018-11-28 11:48:49,134 INFO L794 eck$LassoCheckResult]: Stem: 5111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5106#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 5107#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5154#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5102#L551-3 main_#t~short9 := main_#t~short7; 5103#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5186#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 5137#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5171#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 5169#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5168#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5140#L551-3 main_#t~short9 := main_#t~short7; 5141#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5136#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 5135#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5128#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 5129#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5196#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5194#L551-3 main_#t~short9 := main_#t~short7; 5189#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5190#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 5152#L552 [2018-11-28 11:48:49,134 INFO L796 eck$LassoCheckResult]: Loop: 5152#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 5116#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5117#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5151#L551-3 main_#t~short9 := main_#t~short7; 5146#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5147#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 5132#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5133#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 5162#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5161#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5160#L551-3 main_#t~short9 := main_#t~short7; 5158#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5159#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 5232#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 5228#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5229#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5224#L551-3 main_#t~short9 := main_#t~short7; 5225#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5183#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 5182#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 5181#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5178#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 5148#L551-3 main_#t~short9 := main_#t~short7; 5149#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 5179#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 5152#L552 [2018-11-28 11:48:49,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash -740226994, now seen corresponding path program 2 times [2018-11-28 11:48:49,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:49,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:49,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:48:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:49,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash 353655332, now seen corresponding path program 2 times [2018-11-28 11:48:49,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:49,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:49,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:48:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:49,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 155865719, now seen corresponding path program 2 times [2018-11-28 11:48:49,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:49,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:49,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:49,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:48:49,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:49,977 WARN L180 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 139 [2018-11-28 11:48:50,781 WARN L180 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 147 [2018-11-28 11:48:50,911 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-28 11:48:50,914 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:48:50,914 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:48:50,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:48:50,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:48:50,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:48:50,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:48:50,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:48:50,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:48:50,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-28 11:48:50,914 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:48:50,914 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:48:50,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:50,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-28 11:48:50,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:50,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-28 11:48:50,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:50,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:50,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-28 11:48:50,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:50,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-28 11:48:51,128 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2018-11-28 11:48:51,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:51,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:48:51,475 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:48:51,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:51,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:51,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:51,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:51,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:51,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:51,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:51,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:51,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:51,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:51,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:51,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:51,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:51,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:51,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:51,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:51,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:51,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:51,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:51,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:51,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:51,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:51,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:51,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:51,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:51,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:51,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:51,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:51,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:51,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:48:51,503 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:48:51,503 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:48:51,504 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:48:51,504 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:48:51,504 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:48:51,504 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)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 Supporting invariants [] [2018-11-28 11:48:51,636 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:48:51,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:48:51,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:51,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:51,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:48:51,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:48:51,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:48:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:51,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:51,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-28 11:48:51,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:51,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:12 [2018-11-28 11:48:51,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:48:51,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:48:51,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:48:51,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:51,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:14 [2018-11-28 11:48:51,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 11:48:51,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:51,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-11-28 11:48:51,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 11:48:51,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:51,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-11-28 11:48:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 11:48:51,812 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:48:51,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 294 states and 362 transitions. cyclomatic complexity: 79 Second operand 7 states. [2018-11-28 11:48:51,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 294 states and 362 transitions. cyclomatic complexity: 79. Second operand 7 states. Result 541 states and 650 transitions. Complement of second has 10 states. [2018-11-28 11:48:51,882 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-28 11:48:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:48:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-28 11:48:51,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 21 letters. Loop has 25 letters. [2018-11-28 11:48:51,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:51,883 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:48:51,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:51,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:51,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:48:51,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:48:51,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:48:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:51,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:51,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-28 11:48:51,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:51,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:51,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:12 [2018-11-28 11:48:51,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:48:51,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:51,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:48:51,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:48:52,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:52,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:14 [2018-11-28 11:48:52,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 11:48:52,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:52,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-11-28 11:48:52,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 11:48:52,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:52,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-11-28 11:48:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 11:48:52,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:48:52,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 294 states and 362 transitions. cyclomatic complexity: 79 Second operand 7 states. [2018-11-28 11:48:52,182 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 294 states and 362 transitions. cyclomatic complexity: 79. Second operand 7 states. Result 541 states and 650 transitions. Complement of second has 10 states. [2018-11-28 11:48:52,184 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-28 11:48:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:48:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-28 11:48:52,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 21 letters. Loop has 25 letters. [2018-11-28 11:48:52,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:52,184 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:48:52,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:52,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:52,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:48:52,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:48:52,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:48:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:52,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:52,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-28 11:48:52,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:52,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:12 [2018-11-28 11:48:52,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:48:52,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:48:52,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:48:52,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:52,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:14 [2018-11-28 11:48:52,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 11:48:52,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:52,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2018-11-28 11:48:52,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-28 11:48:52,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:52,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:52,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:52,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-11-28 11:48:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 11:48:52,449 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:48:52,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 294 states and 362 transitions. cyclomatic complexity: 79 Second operand 7 states. [2018-11-28 11:48:52,518 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 294 states and 362 transitions. cyclomatic complexity: 79. Second operand 7 states. Result 639 states and 771 transitions. Complement of second has 11 states. [2018-11-28 11:48:52,518 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-28 11:48:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:48:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-28 11:48:52,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 21 letters. Loop has 25 letters. [2018-11-28 11:48:52,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:52,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 46 letters. Loop has 25 letters. [2018-11-28 11:48:52,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:52,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 21 letters. Loop has 50 letters. [2018-11-28 11:48:52,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:52,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 639 states and 771 transitions. [2018-11-28 11:48:52,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2018-11-28 11:48:52,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 639 states to 338 states and 409 transitions. [2018-11-28 11:48:52,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 11:48:52,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 11:48:52,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 409 transitions. [2018-11-28 11:48:52,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:48:52,528 INFO L705 BuchiCegarLoop]: Abstraction has 338 states and 409 transitions. [2018-11-28 11:48:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 409 transitions. [2018-11-28 11:48:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 249. [2018-11-28 11:48:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-28 11:48:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2018-11-28 11:48:52,534 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 305 transitions. [2018-11-28 11:48:52,534 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 305 transitions. [2018-11-28 11:48:52,534 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 11:48:52,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 305 transitions. [2018-11-28 11:48:52,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 [2018-11-28 11:48:52,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:48:52,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:48:52,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-11-28 11:48:52,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-11-28 11:48:52,537 INFO L794 eck$LassoCheckResult]: Stem: 7709#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7704#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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; 7705#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7714#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7700#L551-3 main_#t~short9 := main_#t~short7; 7701#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7727#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 7734#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7790#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 7787#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7785#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7783#L551-3 main_#t~short9 := main_#t~short7; 7778#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7779#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 7741#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7740#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 7739#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7738#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7737#L551-3 main_#t~short9 := main_#t~short7; 7735#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7736#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 7792#L552 [2018-11-28 11:48:52,537 INFO L796 eck$LassoCheckResult]: Loop: 7792#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7789#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 7786#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7784#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7782#L551-3 main_#t~short9 := main_#t~short7; 7776#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7777#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 7876#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7740#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 7739#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7738#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 7737#L551-3 main_#t~short9 := main_#t~short7; 7735#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 7736#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 7792#L552 [2018-11-28 11:48:52,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1384291310, now seen corresponding path program 3 times [2018-11-28 11:48:52,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:52,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:52,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:48:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:52,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:52,555 INFO L82 PathProgramCache]: Analyzing trace with hash 969712963, now seen corresponding path program 1 times [2018-11-28 11:48:52,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:52,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:52,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:52,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:48:52,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:52,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1247996012, now seen corresponding path program 4 times [2018-11-28 11:48:52,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:48:52,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:48:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:52,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:48:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:48:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:48:52,941 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2018-11-28 11:48:53,641 WARN L180 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 144 [2018-11-28 11:48:53,759 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-28 11:48:53,762 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:48:53,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:48:53,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:48:53,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:48:53,762 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:48:53,762 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:48:53,762 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:48:53,762 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:48:53,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-28 11:48:53,762 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:48:53,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:48:53,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:53,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:53,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:53,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:53,956 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2018-11-28 11:48:54,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:48:54,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:48:54,353 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:48:54,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:48:54,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:48:54,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:48:54,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:54,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:54,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:54,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:54,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,364 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:48:54,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,365 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:48:54,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:54,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,372 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:48:54,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,373 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:48:54,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:54,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:54,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:48:54,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:48:54,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:48:54,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:48:54,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:48:54,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:48:54,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:48:54,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:48:54,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:48:54,388 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:48:54,388 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:48:54,389 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:48:54,389 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:48:54,389 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:48:54,389 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)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9 Supporting invariants [] [2018-11-28 11:48:54,559 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:48:54,562 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:48:54,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:48:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:54,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:54,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:54,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 11:48:54,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:54,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:54,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:48:54,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 11:48:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:48:54,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:48:54,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:54,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-11-28 11:48:54,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:54,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 11:48:54,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 11:48:54,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:54,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:16 [2018-11-28 11:48:54,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:54,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-28 11:48:54,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:48:54,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-28 11:48:54,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 11:48:54,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:48:54,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:48:54,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:18 [2018-11-28 11:48:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:48:54,866 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 11:48:54,867 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 305 transitions. cyclomatic complexity: 65 Second operand 8 states. [2018-11-28 11:48:54,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 305 transitions. cyclomatic complexity: 65. Second operand 8 states. Result 547 states and 674 transitions. Complement of second has 11 states. [2018-11-28 11:48:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 11:48:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 11:48:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-28 11:48:54,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 14 letters. [2018-11-28 11:48:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:54,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 14 letters. [2018-11-28 11:48:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:54,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 28 letters. [2018-11-28 11:48:54,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:48:54,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 547 states and 674 transitions. [2018-11-28 11:48:54,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:48:54,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 547 states to 0 states and 0 transitions. [2018-11-28 11:48:54,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:48:54,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:48:54,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:48:54,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:48:54,955 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:48:54,956 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:48:54,956 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:48:54,956 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 11:48:54,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:48:54,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:48:54,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:48:54,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:48:54 BoogieIcfgContainer [2018-11-28 11:48:54,962 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:48:54,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:48:54,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:48:54,963 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:48:54,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:45:17" (3/4) ... [2018-11-28 11:48:54,967 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:48:54,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:48:54,967 INFO L168 Benchmark]: Toolchain (without parser) took 218273.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.4 MB). Free memory was 950.6 MB in the beginning and 839.1 MB in the end (delta: 111.5 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:48:54,968 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:48:54,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:48:54,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.20 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:48:54,969 INFO L168 Benchmark]: Boogie Preprocessor took 16.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:48:54,969 INFO L168 Benchmark]: RCFGBuilder took 222.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.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:48:54,969 INFO L168 Benchmark]: BuchiAutomizer took 217650.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.1 GB in the beginning and 839.1 MB in the end (delta: 264.9 MB). Peak memory consumption was 377.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:48:54,969 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 839.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:48:54,971 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.20 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 222.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.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 217650.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.1 GB in the beginning and 839.1 MB in the end (delta: 264.9 MB). Peak memory consumption was 377.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.3 GB. Free memory is still 839.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (1 trivial, 5 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@70a0a83e and consists of 15 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 217.6s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 14.0s. Construction of modules took 196.1s. Büchi inclusion checks took 7.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 354 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 294 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 54/55 HoareTripleCheckerStatistics: 168 SDtfs, 335 SDslu, 142 SDs, 0 SdLazy, 561 SolverSat, 121 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 196.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso9 LassoPreprocessingBenchmarks: Lassos: inital444 mio100 ax105 hnf99 lsp86 ukn57 mio100 lsp37 div100 bol100 ite100 ukn100 eq187 hnf88 smp97 dnf105 smp96 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...