./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-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_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/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 4ab4fc7901859c456c176827e7d5fcf9e4988b17 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25:51,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:25:51,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:25:51,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:25:51,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:25:51,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:25:51,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:25:51,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:25:51,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:25:51,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:25:51,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:25:51,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:25:51,072 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:25:51,073 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:25:51,073 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:25:51,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:25:51,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:25:51,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:25:51,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:25:51,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:25:51,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:25:51,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:25:51,081 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:25:51,081 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:25:51,081 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:25:51,082 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:25:51,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:25:51,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:25:51,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:25:51,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:25:51,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:25:51,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:25:51,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:25:51,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:25:51,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:25:51,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:25:51,087 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:25:51,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:25:51,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:25:51,099 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:25:51,099 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:25:51,099 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:25:51,099 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:25:51,099 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:25:51,100 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:25:51,100 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:25:51,100 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:25:51,100 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:25:51,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:25:51,100 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:25:51,100 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:25:51,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:25:51,101 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:25:51,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:25:51,101 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:25:51,101 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:25:51,101 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:25:51,101 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:25:51,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:25:51,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:25:51,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:25:51,102 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:25:51,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:25:51,102 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:25:51,102 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:25:51,103 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:25:51,103 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_83b22bd7-6bd5-4789-9bb4-9a3377817d60/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 -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2018-11-28 11:25:51,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:25:51,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:25:51,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:25:51,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:25:51,139 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:25:51,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-28 11:25:51,184 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/data/d0986d240/0e2c435d4edb4e5a8feb5cd7e2ff98b2/FLAG681749037 [2018-11-28 11:25:51,552 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:25:51,553 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-28 11:25:51,560 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/data/d0986d240/0e2c435d4edb4e5a8feb5cd7e2ff98b2/FLAG681749037 [2018-11-28 11:25:51,569 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/data/d0986d240/0e2c435d4edb4e5a8feb5cd7e2ff98b2 [2018-11-28 11:25:51,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:25:51,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:25:51,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:25:51,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:25:51,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:25:51,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3952dd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51, skipping insertion in model container [2018-11-28 11:25:51,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:25:51,607 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:25:51,774 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:25:51,783 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:25:51,850 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:25:51,881 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:25:51,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51 WrapperNode [2018-11-28 11:25:51,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:25:51,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:25:51,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:25:51,882 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:25:51,889 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:25:51" (1/1) ... [2018-11-28 11:25:51,899 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:25:51" (1/1) ... [2018-11-28 11:25:51,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:25:51,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:25:51,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:25:51,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:25:51,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (1/1) ... [2018-11-28 11:25:51,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:25:51,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:25:51,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:25:51,931 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:25:51,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/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:25:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:25:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:25:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:25:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:25:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:25:51,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:25:52,140 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:25:52,141 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 11:25:52,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:52 BoogieIcfgContainer [2018-11-28 11:25:52,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:25:52,141 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:25:52,141 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:25:52,145 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:25:52,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:25:52,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:25:51" (1/3) ... [2018-11-28 11:25:52,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10712919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:25:52, skipping insertion in model container [2018-11-28 11:25:52,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:25:52,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:51" (2/3) ... [2018-11-28 11:25:52,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10712919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:25:52, skipping insertion in model container [2018-11-28 11:25:52,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:25:52,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:52" (3/3) ... [2018-11-28 11:25:52,149 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-28 11:25:52,197 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:25:52,198 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:25:52,198 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:25:52,198 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:25:52,198 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:25:52,198 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:25:52,198 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:25:52,198 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:25:52,199 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:25:52,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 11:25:52,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:52,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:52,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:52,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:25:52,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:52,236 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:25:52,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 11:25:52,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:52,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:52,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:52,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:25:52,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:52,244 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#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~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, 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;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2018-11-28 11:25:52,244 INFO L796 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~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;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2018-11-28 11:25:52,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:25:52,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:52,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:52,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:52,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-11-28 11:25:52,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:52,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:52,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-11-28 11:25:52,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:52,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:52,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:52,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:52,685 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-28 11:25:52,890 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-11-28 11:25:52,959 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:52,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:52,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:52,960 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:52,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:52,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:52,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:52,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:52,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 11:25:52,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:52,961 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:52,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:52,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:52,998 INFO 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:25:53,000 INFO 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:25:53,003 INFO 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:25:53,005 INFO 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:25:53,007 INFO 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:25:53,019 INFO 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:25:53,022 INFO 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:25:53,024 INFO 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:25:53,027 INFO 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:25:53,029 INFO 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:25:53,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:25:53,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:25:53,034 INFO 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:25:53,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:25:53,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:25:53,040 INFO 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:25:53,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:25:53,043 INFO 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:25:53,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:25:53,231 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-11-28 11:25:53,304 INFO 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:25:53,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:25:53,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:25:53,649 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:25:53,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,656 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:25:53,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,658 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:25:53,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,663 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:25:53,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,665 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:25:53,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,668 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:25:53,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,670 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:25:53,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,672 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:25:53,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,679 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:25:53,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,681 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:25:53,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,684 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:25:53,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,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:25:53,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,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:25:53,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:53,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:53,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,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:25:53,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,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:25:53,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,711 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:25:53,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:53,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:53,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:53,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:53,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,716 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:25:53,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:53,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,721 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:53,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,722 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:53,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,732 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:25:53,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,757 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:25:53,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,758 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:53,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,759 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:53,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,768 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:25:53,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,777 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:25:53,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,781 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:25:53,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,781 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:53,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,783 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:53,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,789 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:25:53,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,811 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:25:53,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:53,819 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:25:53,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:53,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:53,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:53,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:53,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:53,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:53,840 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:25:53,851 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:25:53,851 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:25:53,853 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:25:53,854 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:25:53,855 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:25:53,855 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, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*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_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2018-11-28 11:25:53,971 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:25:53,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:53,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:53,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:53,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:54,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:54,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:54,083 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:25:54,096 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:25:54,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-11-28 11:25:54,174 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2018-11-28 11:25:54,175 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:25:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:25:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-28 11:25:54,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 11:25:54,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:54,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 11:25:54,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:54,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 11:25:54,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:54,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-11-28 11:25:54,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:54,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2018-11-28 11:25:54,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 11:25:54,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:25:54,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2018-11-28 11:25:54,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:54,187 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 11:25:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2018-11-28 11:25:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 11:25:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 11:25:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-28 11:25:54,206 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 11:25:54,206 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 11:25:54,206 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:25:54,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-28 11:25:54,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:54,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:54,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:54,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:25:54,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:54,208 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#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~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, 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;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2018-11-28 11:25:54,208 INFO L796 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~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;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2018-11-28 11:25:54,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:54,208 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2018-11-28 11:25:54,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:54,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:54,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:54,243 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:25:54,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:54,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:25:54,246 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:25:54,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-11-28 11:25:54,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:54,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:54,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:54,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:54,396 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-28 11:25:54,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:25:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:25:54,430 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 11:25:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:54,437 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-28 11:25:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:25:54,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-11-28 11:25:54,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:54,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2018-11-28 11:25:54,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:25:54,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:25:54,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-11-28 11:25:54,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:54,439 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-28 11:25:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-11-28 11:25:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 11:25:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 11:25:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-28 11:25:54,441 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-28 11:25:54,441 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-28 11:25:54,441 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:25:54,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-28 11:25:54,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:54,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:54,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:54,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:25:54,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:54,442 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#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~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, 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;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2018-11-28 11:25:54,442 INFO L796 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~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;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2018-11-28 11:25:54,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2018-11-28 11:25:54,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:54,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:54,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:54,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:54,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:54,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:54,462 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:25:54,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:54,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2018-11-28 11:25:54,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:54,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:54,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:54,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:54,618 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-28 11:25:54,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:54,659 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 11:25:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:54,677 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-28 11:25:54,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:25:54,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2018-11-28 11:25:54,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:54,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-11-28 11:25:54,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:25:54,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:25:54,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-28 11:25:54,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:54,679 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 11:25:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-28 11:25:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 11:25:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 11:25:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 11:25:54,681 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 11:25:54,681 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 11:25:54,681 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:25:54,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 11:25:54,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:54,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:54,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:54,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:25:54,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:54,682 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 313#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~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, 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;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2018-11-28 11:25:54,682 INFO L796 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~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;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2018-11-28 11:25:54,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:54,682 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-11-28 11:25:54,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:54,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:54,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:54,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:54,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:54,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2018-11-28 11:25:54,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:54,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:54,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:54,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:54,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2018-11-28 11:25:54,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:54,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:54,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:54,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83b22bd7-6bd5-4789-9bb4-9a3377817d60/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:54,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:54,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:54,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:25:54,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-28 11:25:54,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,920 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 52 [2018-11-28 11:25:54,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,940 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:25:54,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,948 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-28 11:25:54,951 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:25:54,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,982 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:25:54,985 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 10 treesize of output 9 [2018-11-28 11:25:54,986 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:55,002 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:25:55,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:55,015 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:18 [2018-11-28 11:25:55,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 11:25:55,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-28 11:25:55,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:55,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:25:55,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:55,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:55,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:55,085 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-28 11:25:55,092 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:25:55,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:25:55,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-28 11:25:55,283 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-28 11:25:55,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:25:55,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:25:55,315 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 11:25:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:55,346 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-28 11:25:55,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:55,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-28 11:25:55,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:55,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2018-11-28 11:25:55,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:25:55,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:25:55,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-28 11:25:55,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:55,348 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-28 11:25:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-28 11:25:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-11-28 11:25:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:25:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 11:25:55,350 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 11:25:55,350 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 11:25:55,350 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:25:55,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-28 11:25:55,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:55,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:55,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:55,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:25:55,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:55,351 INFO L794 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 407#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~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, 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;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 408#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 409#L554-1 [2018-11-28 11:25:55,351 INFO L796 eck$LassoCheckResult]: Loop: 409#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 410#L554-3 main_#t~short12 := main_#t~short10; 416#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 403#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 404#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 409#L554-1 [2018-11-28 11:25:55,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 11:25:55,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:55,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:55,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:55,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:55,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2018-11-28 11:25:55,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:55,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:55,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:55,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:55,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:55,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2018-11-28 11:25:55,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:55,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:55,554 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-11-28 11:25:55,665 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 11:25:55,824 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 11:25:55,997 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-28 11:25:55,999 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:55,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:55,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:55,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:56,000 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:56,000 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:56,000 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:56,000 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:56,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 11:25:56,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:56,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:56,007 INFO 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:25:56,014 INFO 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:25:56,019 INFO 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:25:56,021 INFO 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:25:56,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:25:56,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:25:56,416 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-11-28 11:25:56,520 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2018-11-28 11:25:56,521 INFO 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:25:56,522 INFO 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:25:56,524 INFO 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:25:56,525 INFO 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:25:56,527 INFO 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:25:56,531 INFO 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:25:56,533 INFO 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:25:56,534 INFO 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:25:56,535 INFO 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:25:56,536 INFO 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:25:56,537 INFO 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:25:56,538 INFO 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:25:56,539 INFO 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:25:56,542 INFO 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:25:56,543 INFO 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:25:56,545 INFO 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:25:56,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:25:56,892 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:25:56,892 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:25:56,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:56,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:56,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:56,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,897 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:25:56,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:56,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:56,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:56,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,899 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:25:56,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:56,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:56,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:56,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,900 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:25:56,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:56,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:56,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:56,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,902 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:25:56,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:56,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:56,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,904 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:25:56,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:56,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:56,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,918 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:25:56,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:56,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:56,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,926 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:25:56,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,927 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:56,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,928 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:56,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:56,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,931 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:25:56,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,931 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:56,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,932 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:56,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:56,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,935 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:25:56,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:56,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:56,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:56,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:56,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:56,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:56,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:56,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:56,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:56,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:56,942 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:25:56,944 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:25:56,944 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:25:56,944 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:25:56,945 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:25:56,945 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:25:56,945 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2018-11-28 11:25:57,035 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:25:57,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:57,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:57,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:57,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,084 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:25:57,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,103 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:25:57,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 11:25:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:57,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:57,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,183 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 100 treesize of output 62 [2018-11-28 11:25:57,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,196 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 33 treesize of output 22 [2018-11-28 11:25:57,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,211 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 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-28 11:25:57,215 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:25:57,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-28 11:25:57,258 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 46 treesize of output 45 [2018-11-28 11:25:57,259 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,380 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-28 11:25:57,380 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:57,427 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:57,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:57,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:57,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:25:57,513 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-28 11:25:57,575 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:25:57,576 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:25:57,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-28 11:25:57,676 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2018-11-28 11:25:57,677 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:25:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:25:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-28 11:25:57,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 11:25:57,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:57,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:25:57,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:57,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2018-11-28 11:25:57,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:57,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2018-11-28 11:25:57,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:57,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2018-11-28 11:25:57,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 11:25:57,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 11:25:57,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-28 11:25:57,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:57,684 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-28 11:25:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-28 11:25:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-11-28 11:25:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 11:25:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-28 11:25:57,685 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 11:25:57,685 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 11:25:57,685 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:25:57,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-28 11:25:57,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:57,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:57,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:57,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:25:57,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:57,686 INFO L794 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 619#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~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, 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;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 620#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 621#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 625#L554-3 main_#t~short12 := main_#t~short10; 628#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 617#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 618#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~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;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 622#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 623#L554-1 [2018-11-28 11:25:57,686 INFO L796 eck$LassoCheckResult]: Loop: 623#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 624#L554-3 main_#t~short12 := main_#t~short10; 627#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 615#L554-6 assume !!main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short10;havoc main_#t~short12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 616#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 629#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 623#L554-1 [2018-11-28 11:25:57,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2018-11-28 11:25:57,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:57,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:57,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:57,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2018-11-28 11:25:57,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:57,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:57,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:57,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:57,719 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2018-11-28 11:25:57,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:57,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:57,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:57,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:57,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:57,906 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-11-28 11:25:58,592 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 124 [2018-11-28 11:25:59,086 WARN L180 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 11:25:59,089 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:59,089 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:59,089 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:59,089 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:59,089 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:59,089 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:59,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:59,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:59,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 11:25:59,090 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:59,090 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:59,093 INFO 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:25:59,095 INFO 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:25:59,098 INFO 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:25:59,100 INFO 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:25:59,101 INFO 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:25:59,102 INFO 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:25:59,103 INFO 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:25:59,104 INFO 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:25:59,106 INFO 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:25:59,107 INFO 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:25:59,108 INFO 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:25:59,109 INFO 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:25:59,109 INFO 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:25:59,110 INFO 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:25:59,111 INFO 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:25:59,112 INFO 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:25:59,113 INFO 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:25:59,114 INFO 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:25:59,498 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-11-28 11:25:59,579 INFO 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:25:59,580 INFO 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:25:59,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,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:25:59,992 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:25:59,992 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:25:59,992 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:25:59,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:59,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:59,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:59,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:59,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:59,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:59,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:59,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:59,994 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:25:59,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:59,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:59,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:59,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:59,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:59,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:59,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:59,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:59,995 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:25:59,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:59,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:59,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:59,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:59,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:59,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:59,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:59,997 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:25:59,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:59,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:59,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:59,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:59,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:59,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:59,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:59,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:59,998 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:25:59,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:59,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:59,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:59,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:59,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:59,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:59,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:59,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:59,999 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:25:59,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:59,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:59,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:59,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,002 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:26:00,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,004 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:26:00,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,006 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:26:00,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,007 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:26:00,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,010 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:26:00,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,011 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:26:00,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,013 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:26:00,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,014 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:26:00,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,016 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:26:00,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,018 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:26:00,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,020 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:26:00,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,022 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:26:00,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,023 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:26:00,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,024 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:26:00,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,026 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:26:00,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,030 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:26:00,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,034 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:26:00,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,044 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:26:00,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,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:26:00,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,047 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:26:00,047 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:26:00,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,051 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 11:26:00,051 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 11:26:00,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:26:00,141 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:26:00,156 INFO L444 ModelExtractionUtils]: 33 out of 36 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:26:00,157 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:26:00,158 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 11:26:00,158 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:26:00,158 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2018-11-28 11:26:00,260 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:26:00,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:26:00,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:00,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:00,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,313 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:26:00,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,326 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:26:00,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 11:26:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:00,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:00,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,407 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 100 treesize of output 62 [2018-11-28 11:26:00,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,410 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 33 treesize of output 22 [2018-11-28 11:26:00,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,421 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 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-28 11:26:00,423 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:26:00,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-28 11:26:00,455 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 46 treesize of output 45 [2018-11-28 11:26:00,455 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,493 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-28 11:26:00,494 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 11:26:00,512 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:00,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:00,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:00,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:26:00,552 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-28 11:26:00,585 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:26:00,585 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:26:00,585 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-28 11:26:00,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2018-11-28 11:26:00,617 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:26:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:26:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-28 11:26:00,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:26:00,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:26:00,618 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:26:00,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:00,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:00,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,647 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:26:00,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,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:26:00,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 11:26:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:00,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:00,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,726 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 100 treesize of output 62 [2018-11-28 11:26:00,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,729 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 33 treesize of output 22 [2018-11-28 11:26:00,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,739 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 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-28 11:26:00,740 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:26:00,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-28 11:26:00,770 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 46 treesize of output 45 [2018-11-28 11:26:00,770 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,808 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-28 11:26:00,808 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 11:26:00,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:00,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:00,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:00,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:26:00,868 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-28 11:26:00,899 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:26:00,899 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:26:00,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-28 11:26:00,931 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2018-11-28 11:26:00,931 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:26:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:26:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-28 11:26:00,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:26:00,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:26:00,932 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:26:00,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:00,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:00,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,960 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:26:00,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,971 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:26:00,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 11:26:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:00,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:01,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:01,019 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 100 treesize of output 62 [2018-11-28 11:26:01,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:01,022 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 33 treesize of output 22 [2018-11-28 11:26:01,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:01,032 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 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-28 11:26:01,034 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:26:01,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:01,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-28 11:26:01,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:01,061 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 54 [2018-11-28 11:26:01,061 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:26:01,090 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 34 treesize of output 33 [2018-11-28 11:26:01,091 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:01,104 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:01,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:01,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:26:01,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:26:01,143 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-28 11:26:01,175 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:26:01,175 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:26:01,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-28 11:26:01,224 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2018-11-28 11:26:01,224 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:26:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:26:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-28 11:26:01,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:26:01,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:26:01,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 11:26:01,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:26:01,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-28 11:26:01,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:26:01,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-28 11:26:01,226 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:26:01,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-28 11:26:01,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:26:01,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:26:01,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:26:01,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:26:01,227 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:26:01,227 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:26:01,227 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:26:01,227 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:26:01,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:26:01,227 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:26:01,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:26:01,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:26:01 BoogieIcfgContainer [2018-11-28 11:26:01,232 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:26:01,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:26:01,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:26:01,233 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:26:01,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:52" (3/4) ... [2018-11-28 11:26:01,236 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:26:01,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:26:01,236 INFO L168 Benchmark]: Toolchain (without parser) took 9665.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 240.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:01,237 INFO L168 Benchmark]: CDTParser took 0.14 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:26:01,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:01,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:01,238 INFO L168 Benchmark]: Boogie Preprocessor took 17.86 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:26:01,238 INFO L168 Benchmark]: RCFGBuilder took 210.48 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:01,238 INFO L168 Benchmark]: BuchiAutomizer took 9090.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 255.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:01,238 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:26:01,240 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.14 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 309.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.86 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 210.48 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9090.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 255.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 46 SDslu, 46 SDs, 0 SdLazy, 136 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1016 mio100 ax103 hnf99 lsp64 ukn53 mio100 lsp30 div100 bol104 ite100 ukn100 eq171 hnf88 smp97 dnf220 smp66 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 111ms VariablesStem: 7 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...