./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3cca4963db77635bc2da65f99e90064d806437e6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:15,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:15,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:15,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:15,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:15,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:15,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:15,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:15,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:15,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:15,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:15,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:15,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:15,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:15,193 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:15,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:15,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:15,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:15,200 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:15,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:15,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:15,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:15,210 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:15,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:15,212 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:15,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:15,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:15,215 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:15,216 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:15,217 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:15,217 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:15,218 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:15,218 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:15,218 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:15,219 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:15,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:15,221 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:10:15,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:15,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:15,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:15,234 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:15,234 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:15,234 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:15,234 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:15,234 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:15,234 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:15,235 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:15,235 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:15,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:15,235 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:15,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:15,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:15,237 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:15,237 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:15,237 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:15,237 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:15,238 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:15,238 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:15,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:15,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:15,238 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:15,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:15,239 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:15,239 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:15,240 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:15,240 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_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cca4963db77635bc2da65f99e90064d806437e6 [2018-10-27 06:10:15,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:15,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:15,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:15,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:15,297 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:15,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-10-27 06:10:15,361 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/data/40da6f492/6d5556ba216e4cce8d254f94a1fc95cd/FLAG2bb1748a1 [2018-10-27 06:10:15,784 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:15,784 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-10-27 06:10:15,797 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/data/40da6f492/6d5556ba216e4cce8d254f94a1fc95cd/FLAG2bb1748a1 [2018-10-27 06:10:15,810 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/bin-2019/uautomizer/data/40da6f492/6d5556ba216e4cce8d254f94a1fc95cd [2018-10-27 06:10:15,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:15,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:15,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:15,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:15,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:15,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:15" (1/1) ... [2018-10-27 06:10:15,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89c8a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:15, skipping insertion in model container [2018-10-27 06:10:15,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:15" (1/1) ... [2018-10-27 06:10:15,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:15,872 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:16,117 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:16,126 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:16,167 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:16,202 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:16,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16 WrapperNode [2018-10-27 06:10:16,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:16,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:16,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:16,204 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:16,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:16,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:16,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:16,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:16,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... [2018-10-27 06:10:16,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:16,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:16,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:16,341 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:16,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4b69ffc-b434-4d39-9305-b7ce2f33e01f/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-10-27 06:10:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:10:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:10:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:16,960 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:16,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:16 BoogieIcfgContainer [2018-10-27 06:10:16,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:16,962 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:16,962 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:16,966 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:16,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:16,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:15" (1/3) ... [2018-10-27 06:10:16,968 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31f7218b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:16, skipping insertion in model container [2018-10-27 06:10:16,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:16,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:16" (2/3) ... [2018-10-27 06:10:16,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31f7218b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:16, skipping insertion in model container [2018-10-27 06:10:16,969 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:16,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:16" (3/3) ... [2018-10-27 06:10:16,971 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-10-27 06:10:17,029 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:17,030 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:17,030 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:17,030 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:17,031 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:17,031 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:17,032 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:17,032 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:17,032 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:17,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:10:17,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:10:17,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:17,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:17,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:10:17,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:17,079 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:17,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:10:17,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:10:17,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:17,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:17,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:10:17,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:17,091 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 9#L554-2true [2018-10-27 06:10:17,093 INFO L795 eck$LassoCheckResult]: Loop: 9#L554-2true assume true; 33#L551-1true SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 34#L551-2true main_#t~short7 := main_#t~mem5 > 0; 16#L551-3true assume !main_#t~short7; 25#L551-7true main_#t~short9 := main_#t~short7; 27#L551-8true assume !main_#t~short9; 13#L551-12true assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 10#L552true assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 28#L553true SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 31#L553-1true SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 32#L553-2true havoc main_#t~mem11; 9#L554-2true [2018-10-27 06:10:17,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,104 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:10:17,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1066255600, now seen corresponding path program 1 times [2018-10-27 06:10:17,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:17,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:17,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:17,334 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:17,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:17,353 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-10-27 06:10:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:17,424 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-10-27 06:10:17,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:17,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-10-27 06:10:17,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:10:17,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 28 states and 31 transitions. [2018-10-27 06:10:17,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-10-27 06:10:17,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-10-27 06:10:17,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-10-27 06:10:17,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:17,433 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-27 06:10:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-10-27 06:10:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-27 06:10:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 06:10:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-27 06:10:17,459 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-27 06:10:17,459 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-27 06:10:17,459 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:17,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2018-10-27 06:10:17,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:10:17,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:17,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:17,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:10:17,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:17,462 INFO L793 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 75#L554-2 [2018-10-27 06:10:17,462 INFO L795 eck$LassoCheckResult]: Loop: 75#L554-2 assume true; 82#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 101#L551-2 main_#t~short7 := main_#t~mem5 > 0; 88#L551-3 assume !main_#t~short7; 89#L551-7 main_#t~short9 := main_#t~short7; 97#L551-8 assume main_#t~short9; 80#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 81#L551-10 main_#t~short9 := main_#t~mem8 > 0; 86#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 83#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 84#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 98#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 100#L553-2 havoc main_#t~mem11; 75#L554-2 [2018-10-27 06:10:17,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:10:17,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,481 INFO L82 PathProgramCache]: Analyzing trace with hash -566995533, now seen corresponding path program 1 times [2018-10-27 06:10:17,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:17,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:17,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:17,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:10:17,525 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:17,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:10:17,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:10:17,526 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-10-27 06:10:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:17,634 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-10-27 06:10:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:17,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2018-10-27 06:10:17,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:10:17,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 30 transitions. [2018-10-27 06:10:17,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-10-27 06:10:17,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-10-27 06:10:17,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2018-10-27 06:10:17,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:17,638 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-27 06:10:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2018-10-27 06:10:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-27 06:10:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 06:10:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-10-27 06:10:17,641 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-27 06:10:17,641 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-27 06:10:17,641 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:17,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-10-27 06:10:17,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:10:17,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:17,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:17,642 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:10:17,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:17,643 INFO L793 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 142#L554-2 [2018-10-27 06:10:17,643 INFO L795 eck$LassoCheckResult]: Loop: 142#L554-2 assume true; 149#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 168#L551-2 main_#t~short7 := main_#t~mem5 > 0; 155#L551-3 assume main_#t~short7; 156#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 159#L551-5 main_#t~short7 := main_#t~mem6 > 0; 161#L551-7 main_#t~short9 := main_#t~short7; 164#L551-8 assume main_#t~short9; 147#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 148#L551-10 main_#t~short9 := main_#t~mem8 > 0; 153#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 150#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 151#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 165#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 167#L553-2 havoc main_#t~mem11; 142#L554-2 [2018-10-27 06:10:17,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,647 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-10-27 06:10:17,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1565181494, now seen corresponding path program 1 times [2018-10-27 06:10:17,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:17,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash 57574964, now seen corresponding path program 1 times [2018-10-27 06:10:17,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:17,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:17,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:18,265 WARN L179 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-10-27 06:10:18,679 WARN L179 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 06:10:18,758 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:18,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:18,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:18,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:18,760 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:18,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:18,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:18,760 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:18,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:10:18,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:18,761 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:18,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:18,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,247 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2018-10-27 06:10:19,479 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-10-27 06:10:19,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,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-10-27 06:10:19,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,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-10-27 06:10:19,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-10-27 06:10:19,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-10-27 06:10:19,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:19,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:20,118 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:20,123 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:20,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:20,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:20,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:20,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:20,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,138 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:20,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,139 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:10:20,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:20,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:20,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:20,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:20,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:20,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:20,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:20,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:20,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:20,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:20,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:20,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:20,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,194 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:20,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,198 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:20,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:20,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:20,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:20,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,225 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:20,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,229 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:20,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:20,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:20,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:20,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:20,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:20,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:20,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:20,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:20,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:20,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:20,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:20,251 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:20,251 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:20,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:20,254 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:10:20,254 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:20,255 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-10-27 06:10:20,562 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:20,584 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:20,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:20,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:20,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:20,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:20,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 06:10:20,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:10:20,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:20,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:20,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:20,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:10:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:20,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:20,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 30 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-10-27 06:10:21,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 30 transitions. cyclomatic complexity: 3. Second operand 8 states. Result 69 states and 74 transitions. Complement of second has 15 states. [2018-10-27 06:10:21,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-10-27 06:10:21,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 2 letters. Loop has 15 letters. [2018-10-27 06:10:21,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:21,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 17 letters. Loop has 15 letters. [2018-10-27 06:10:21,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:21,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 2 letters. Loop has 30 letters. [2018-10-27 06:10:21,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:21,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 74 transitions. [2018-10-27 06:10:21,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:10:21,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 62 states and 67 transitions. [2018-10-27 06:10:21,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-10-27 06:10:21,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-10-27 06:10:21,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 67 transitions. [2018-10-27 06:10:21,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:21,062 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-10-27 06:10:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 67 transitions. [2018-10-27 06:10:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-10-27 06:10:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 06:10:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-27 06:10:21,066 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-27 06:10:21,066 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-27 06:10:21,066 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:21,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2018-10-27 06:10:21,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:10:21,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:21,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:21,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:21,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:21,071 INFO L793 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 433#L554-2 assume true; 439#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 470#L551-2 main_#t~short7 := main_#t~mem5 > 0; 449#L551-3 assume main_#t~short7; 450#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 455#L551-5 main_#t~short7 := main_#t~mem6 > 0; 458#L551-7 main_#t~short9 := main_#t~short7; 462#L551-8 assume main_#t~short9; 434#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 435#L551-10 main_#t~short9 := main_#t~mem8 > 0; 446#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 442#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 443#L554 [2018-10-27 06:10:21,071 INFO L795 eck$LassoCheckResult]: Loop: 443#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 453#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 454#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 457#L558-2 havoc main_#t~mem15; 448#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 427#L559-1 havoc main_#t~nondet16; 428#L554-2 assume true; 482#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 481#L551-2 main_#t~short7 := main_#t~mem5 > 0; 480#L551-3 assume main_#t~short7; 479#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 478#L551-5 main_#t~short7 := main_#t~mem6 > 0; 477#L551-7 main_#t~short9 := main_#t~short7; 476#L551-8 assume main_#t~short9; 475#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 474#L551-10 main_#t~short9 := main_#t~mem8 > 0; 473#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 472#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 443#L554 [2018-10-27 06:10:21,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash -521460811, now seen corresponding path program 1 times [2018-10-27 06:10:21,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:21,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:21,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 469538838, now seen corresponding path program 1 times [2018-10-27 06:10:21,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:21,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:21,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:21,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:21,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1622034742, now seen corresponding path program 1 times [2018-10-27 06:10:21,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:21,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:21,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:21,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:21,358 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2018-10-27 06:10:21,725 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 94 [2018-10-27 06:10:21,801 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:21,801 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:21,801 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:21,801 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:21,802 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:21,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:21,802 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:21,802 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:21,802 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:10:21,802 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:21,802 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:21,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:21,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,117 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2018-10-27 06:10:22,234 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-10-27 06:10:22,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:22,493 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-10-27 06:10:22,873 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:22,873 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:22,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,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-10-27 06:10:22,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,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-10-27 06:10:22,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:22,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:22,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:22,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:22,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,982 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:22,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,986 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:22,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:22,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:22,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-10-27 06:10:22,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:22,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:22,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:22,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:22,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:22,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:23,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:23,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:23,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:23,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:23,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:23,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:23,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:23,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:23,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:23,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-10-27 06:10:23,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:23,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:23,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:23,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:23,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:23,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:23,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:23,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:23,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:23,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:23,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:23,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:23,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:23,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:23,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:23,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:23,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:23,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:23,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:23,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:23,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:23,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:23,050 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:23,056 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:23,056 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:23,057 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:23,058 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:23,058 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:23,058 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2018-10-27 06:10:23,259 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:23,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:23,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:23,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:23,472 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 06:10:23,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:23,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:10:23,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:23,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:23,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:10:23,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-10-27 06:10:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:23,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:23,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:23,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:23,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:23,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:23,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:23,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:23,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:23,759 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:10:23,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 60 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-10-27 06:10:23,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 60 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 130 states and 143 transitions. Complement of second has 14 states. [2018-10-27 06:10:23,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:10:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-10-27 06:10:23,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 14 letters. Loop has 18 letters. [2018-10-27 06:10:23,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:23,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 32 letters. Loop has 18 letters. [2018-10-27 06:10:23,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:23,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 14 letters. Loop has 36 letters. [2018-10-27 06:10:23,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:23,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 143 transitions. [2018-10-27 06:10:23,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:10:23,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 111 states and 121 transitions. [2018-10-27 06:10:23,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-10-27 06:10:23,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-10-27 06:10:23,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 121 transitions. [2018-10-27 06:10:23,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:23,918 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-10-27 06:10:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 121 transitions. [2018-10-27 06:10:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-10-27 06:10:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 06:10:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-10-27 06:10:23,926 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-10-27 06:10:23,926 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-10-27 06:10:23,926 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:23,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 116 transitions. [2018-10-27 06:10:23,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:10:23,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:23,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:23,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:23,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:23,929 INFO L793 eck$LassoCheckResult]: Stem: 901#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 857#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 858#L554-2 assume true; 932#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 930#L551-2 main_#t~short7 := main_#t~mem5 > 0; 928#L551-3 assume main_#t~short7; 926#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 924#L551-5 main_#t~short7 := main_#t~mem6 > 0; 922#L551-7 main_#t~short9 := main_#t~short7; 920#L551-8 assume main_#t~short9; 918#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 916#L551-10 main_#t~short9 := main_#t~mem8 > 0; 914#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 912#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 910#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 854#L555 [2018-10-27 06:10:23,929 INFO L795 eck$LassoCheckResult]: Loop: 854#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 855#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 856#L555-2 havoc main_#t~mem13; 891#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 892#L556-1 havoc main_#t~nondet14; 851#L554-2 assume true; 931#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 929#L551-2 main_#t~short7 := main_#t~mem5 > 0; 927#L551-3 assume main_#t~short7; 925#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 923#L551-5 main_#t~short7 := main_#t~mem6 > 0; 921#L551-7 main_#t~short9 := main_#t~short7; 919#L551-8 assume main_#t~short9; 917#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 915#L551-10 main_#t~short9 := main_#t~mem8 > 0; 913#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 911#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 909#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 854#L555 [2018-10-27 06:10:23,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1014584085, now seen corresponding path program 1 times [2018-10-27 06:10:23,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1974303956, now seen corresponding path program 1 times [2018-10-27 06:10:23,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1233959232, now seen corresponding path program 1 times [2018-10-27 06:10:23,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:25,194 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-10-27 06:10:25,474 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 100 [2018-10-27 06:10:25,559 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:25,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:25,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:25,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:25,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:25,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:25,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:25,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:25,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:10:25,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:25,560 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:25,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,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-10-27 06:10:25,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-10-27 06:10:25,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:25,866 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2018-10-27 06:10:26,009 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-10-27 06:10:26,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:26,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:26,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-10-27 06:10:26,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-10-27 06:10:26,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:26,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:26,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-10-27 06:10:26,545 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:26,546 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:26,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:26,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:26,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:26,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,592 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:26,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:26,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,603 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:26,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,603 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:10:26,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:26,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:26,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:26,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,619 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:26,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,620 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:26,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,625 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:26,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,626 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:26,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:26,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:26,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:26,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:26,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:26,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:26,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:26,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:26,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:26,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:26,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:26,688 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:10:26,688 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:10:26,688 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:26,689 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:26,689 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:26,689 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 Supporting invariants [] [2018-10-27 06:10:26,824 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:26,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:26,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:26,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:26,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 06:10:26,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:26,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:26,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 06:10:26,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-10-27 06:10:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:26,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:26,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:26,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:26,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:26,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:26,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:26,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:26,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:26,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:27,115 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:10:27,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-10-27 06:10:27,342 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 155 states and 168 transitions. Complement of second has 16 states. [2018-10-27 06:10:27,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:10:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-10-27 06:10:27,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 15 letters. Loop has 18 letters. [2018-10-27 06:10:27,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:27,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 33 letters. Loop has 18 letters. [2018-10-27 06:10:27,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:27,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 15 letters. Loop has 36 letters. [2018-10-27 06:10:27,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:27,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 168 transitions. [2018-10-27 06:10:27,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:10:27,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 135 states and 147 transitions. [2018-10-27 06:10:27,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-10-27 06:10:27,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-10-27 06:10:27,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 147 transitions. [2018-10-27 06:10:27,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:27,351 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-10-27 06:10:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 147 transitions. [2018-10-27 06:10:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2018-10-27 06:10:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-27 06:10:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2018-10-27 06:10:27,361 INFO L728 BuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2018-10-27 06:10:27,361 INFO L608 BuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2018-10-27 06:10:27,361 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:27,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 141 transitions. [2018-10-27 06:10:27,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:10:27,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:27,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:27,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:27,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:27,368 INFO L793 eck$LassoCheckResult]: Stem: 1412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1367#L554-2 assume true; 1442#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1440#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1439#L551-3 assume main_#t~short7; 1437#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1435#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1433#L551-7 main_#t~short9 := main_#t~short7; 1431#L551-8 assume main_#t~short9; 1429#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 1427#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1425#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 1423#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 1421#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 1393#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 1394#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 1398#L558-2 havoc main_#t~mem15; 1386#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 1358#L559-1 havoc main_#t~nondet16; 1359#L554-2 assume true; 1474#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1473#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1471#L551-3 assume main_#t~short7; 1470#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1469#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1467#L551-7 main_#t~short9 := main_#t~short7; 1465#L551-8 assume main_#t~short9; 1463#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 1461#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1459#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 1451#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 1452#L553 [2018-10-27 06:10:27,368 INFO L795 eck$LassoCheckResult]: Loop: 1452#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 1447#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 1446#L553-2 havoc main_#t~mem11; 1445#L554-2 assume true; 1443#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1441#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1387#L551-3 assume main_#t~short7; 1388#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1395#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1399#L551-7 main_#t~short9 := main_#t~short7; 1406#L551-8 assume main_#t~short9; 1368#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 1369#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1455#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 1453#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 1452#L553 [2018-10-27 06:10:27,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:27,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1622034747, now seen corresponding path program 1 times [2018-10-27 06:10:27,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:27,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:27,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:27,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:27,417 INFO L82 PathProgramCache]: Analyzing trace with hash 280714288, now seen corresponding path program 2 times [2018-10-27 06:10:27,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:27,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:27,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:27,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash 750044396, now seen corresponding path program 1 times [2018-10-27 06:10:27,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:27,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:27,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:27,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:27,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:28,155 WARN L179 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-10-27 06:10:28,590 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 127 [2018-10-27 06:10:28,686 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:28,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:28,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:28,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:28,687 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:28,687 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:28,687 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:28,687 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:28,687 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:10:28,687 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:28,687 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:28,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,971 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-10-27 06:10:29,109 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-10-27 06:10:29,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-10-27 06:10:29,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-10-27 06:10:29,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,655 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:29,655 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:29,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:29,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:29,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:29,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:29,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:29,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:29,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:29,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:29,657 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:29,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-10-27 06:10:29,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:29,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:29,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:29,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:29,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:29,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:29,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:29,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:29,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:29,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:29,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:29,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:29,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:29,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:29,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:29,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:29,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-10-27 06:10:29,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:29,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:29,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:29,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:29,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:29,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:29,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:29,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:29,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:29,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:29,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:29,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:29,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:29,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:29,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:29,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:29,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:29,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:29,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:29,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:29,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:29,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:29,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:29,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:29,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:29,693 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:29,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:29,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:29,694 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:29,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:29,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:29,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:29,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:29,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:29,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:29,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:29,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:29,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:29,713 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:29,716 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:29,716 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:29,717 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:29,717 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:29,717 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:29,717 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2018-10-27 06:10:29,845 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:29,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:29,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:29,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:29,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:29,904 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:29,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:29,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:29,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:29,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:29,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:29,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:10:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:29,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:29,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-10-27 06:10:30,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 360 states and 389 transitions. Complement of second has 13 states. [2018-10-27 06:10:30,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-10-27 06:10:30,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 32 letters. Loop has 15 letters. [2018-10-27 06:10:30,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:30,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 47 letters. Loop has 15 letters. [2018-10-27 06:10:30,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:30,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 32 letters. Loop has 30 letters. [2018-10-27 06:10:30,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:30,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 360 states and 389 transitions. [2018-10-27 06:10:30,044 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2018-10-27 06:10:30,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 360 states to 298 states and 322 transitions. [2018-10-27 06:10:30,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-10-27 06:10:30,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2018-10-27 06:10:30,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 322 transitions. [2018-10-27 06:10:30,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:30,049 INFO L705 BuchiCegarLoop]: Abstraction has 298 states and 322 transitions. [2018-10-27 06:10:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 322 transitions. [2018-10-27 06:10:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 274. [2018-10-27 06:10:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-27 06:10:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2018-10-27 06:10:30,061 INFO L728 BuchiCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-10-27 06:10:30,061 INFO L608 BuchiCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-10-27 06:10:30,062 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:30,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 274 states and 297 transitions. [2018-10-27 06:10:30,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2018-10-27 06:10:30,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:30,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:30,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:30,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:30,067 INFO L793 eck$LassoCheckResult]: Stem: 2193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2132#L554-2 assume true; 2270#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 2267#L551-2 main_#t~short7 := main_#t~mem5 > 0; 2265#L551-3 assume main_#t~short7; 2263#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 2261#L551-5 main_#t~short7 := main_#t~mem6 > 0; 2259#L551-7 main_#t~short9 := main_#t~short7; 2257#L551-8 assume main_#t~short9; 2255#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 2253#L551-10 main_#t~short9 := main_#t~mem8 > 0; 2251#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 2249#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 2246#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 2247#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 2127#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 2130#L555-2 havoc main_#t~mem13; 2173#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 2174#L556-1 havoc main_#t~nondet14; 2293#L554-2 assume true; 2291#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 2289#L551-2 main_#t~short7 := main_#t~mem5 > 0; 2287#L551-3 assume main_#t~short7; 2285#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 2283#L551-5 main_#t~short7 := main_#t~mem6 > 0; 2281#L551-7 main_#t~short9 := main_#t~short7; 2279#L551-8 assume main_#t~short9; 2276#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 2242#L551-10 main_#t~short9 := main_#t~mem8 > 0; 2243#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 2225#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 2181#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 2158#L558 [2018-10-27 06:10:30,068 INFO L795 eck$LassoCheckResult]: Loop: 2158#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 2159#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 2164#L558-2 havoc main_#t~mem15; 2150#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 2151#L559-1 havoc main_#t~nondet16; 2292#L554-2 assume true; 2290#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 2288#L551-2 main_#t~short7 := main_#t~mem5 > 0; 2286#L551-3 assume main_#t~short7; 2284#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 2282#L551-5 main_#t~short7 := main_#t~mem6 > 0; 2280#L551-7 main_#t~short9 := main_#t~short7; 2278#L551-8 assume main_#t~short9; 2274#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 2275#L551-10 main_#t~short9 := main_#t~mem8 > 0; 2237#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 2238#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 2299#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 2158#L558 [2018-10-27 06:10:30,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1233959239, now seen corresponding path program 1 times [2018-10-27 06:10:30,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:30,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:30,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:30,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:30,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash -335396788, now seen corresponding path program 2 times [2018-10-27 06:10:30,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:30,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:30,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:30,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:30,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -943098862, now seen corresponding path program 1 times [2018-10-27 06:10:30,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:30,321 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2018-10-27 06:10:30,745 WARN L179 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 132 [2018-10-27 06:10:30,863 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:30,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:30,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:30,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:30,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:30,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:30,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:30,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:30,864 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration7_Lasso [2018-10-27 06:10:30,864 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:30,864 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:30,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,185 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-10-27 06:10:31,298 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-10-27 06:10:31,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,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-10-27 06:10:31,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:31,735 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:31,736 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:31,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:31,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:31,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:31,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:31,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:31,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:31,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:31,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:31,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:31,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:31,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:31,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:31,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:31,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:31,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:31,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:31,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:31,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:31,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:31,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:31,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:31,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:31,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:31,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:31,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:31,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:31,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:31,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:31,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:31,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:31,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:31,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:31,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:31,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:31,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:31,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:31,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:31,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:31,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:31,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:31,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:31,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:31,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:31,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:31,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:31,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:31,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:31,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:31,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:31,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:31,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:31,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:31,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:31,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:31,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:31,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:31,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:31,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:31,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:31,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:31,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:31,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:31,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:31,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:31,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:31,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:31,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:31,792 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:31,794 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:31,794 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:31,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:31,795 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:31,795 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:31,795 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_5 Supporting invariants [] [2018-10-27 06:10:31,902 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:31,903 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:31,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:31,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:31,946 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:31,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:10:31,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:31,966 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:31,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:10:31,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:31,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:31,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:31,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-10-27 06:10:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:31,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:32,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:32,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:32,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:32,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:32,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:32,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:32,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:32,195 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:10:32,195 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 274 states and 297 transitions. cyclomatic complexity: 34 Second operand 8 states. [2018-10-27 06:10:32,404 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 274 states and 297 transitions. cyclomatic complexity: 34. Second operand 8 states. Result 645 states and 698 transitions. Complement of second has 14 states. [2018-10-27 06:10:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-10-27 06:10:32,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 33 letters. Loop has 18 letters. [2018-10-27 06:10:32,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:32,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 51 letters. Loop has 18 letters. [2018-10-27 06:10:32,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:32,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 33 letters. Loop has 36 letters. [2018-10-27 06:10:32,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:32,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 645 states and 698 transitions. [2018-10-27 06:10:32,417 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 100 [2018-10-27 06:10:32,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 645 states to 490 states and 530 transitions. [2018-10-27 06:10:32,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2018-10-27 06:10:32,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-10-27 06:10:32,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 490 states and 530 transitions. [2018-10-27 06:10:32,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:32,422 INFO L705 BuchiCegarLoop]: Abstraction has 490 states and 530 transitions. [2018-10-27 06:10:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states and 530 transitions. [2018-10-27 06:10:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 478. [2018-10-27 06:10:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-27 06:10:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 518 transitions. [2018-10-27 06:10:32,458 INFO L728 BuchiCegarLoop]: Abstraction has 478 states and 518 transitions. [2018-10-27 06:10:32,458 INFO L608 BuchiCegarLoop]: Abstraction has 478 states and 518 transitions. [2018-10-27 06:10:32,458 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:10:32,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 518 transitions. [2018-10-27 06:10:32,464 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 100 [2018-10-27 06:10:32,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:32,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:32,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:32,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:32,466 INFO L793 eck$LassoCheckResult]: Stem: 3397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3344#L554-2 assume true; 3475#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3474#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3473#L551-3 assume main_#t~short7; 3472#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3471#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3470#L551-7 main_#t~short9 := main_#t~short7; 3469#L551-8 assume main_#t~short9; 3468#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 3467#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3465#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 3463#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3461#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 3459#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 3457#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 3455#L555-2 havoc main_#t~mem13; 3453#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 3451#L556-1 havoc main_#t~nondet14; 3449#L554-2 assume true; 3447#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3445#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3443#L551-3 assume main_#t~short7; 3441#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3439#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3437#L551-7 main_#t~short9 := main_#t~short7; 3435#L551-8 assume main_#t~short9; 3432#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 3430#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3428#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 3425#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 3426#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 3757#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 3756#L553-2 havoc main_#t~mem11; 3755#L554-2 assume true; 3754#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3753#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3752#L551-3 assume main_#t~short7; 3751#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3750#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3749#L551-7 main_#t~short9 := main_#t~short7; 3748#L551-8 assume main_#t~short9; 3747#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 3746#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3745#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 3409#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3410#L554 [2018-10-27 06:10:32,466 INFO L795 eck$LassoCheckResult]: Loop: 3410#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 3796#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 3795#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 3794#L555-2 havoc main_#t~mem13; 3793#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 3792#L556-1 havoc main_#t~nondet14; 3790#L554-2 assume true; 3789#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3788#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3787#L551-3 assume main_#t~short7; 3371#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3372#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3803#L551-7 main_#t~short9 := main_#t~short7; 3802#L551-8 assume main_#t~short9; 3801#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 3800#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3799#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 3798#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3410#L554 [2018-10-27 06:10:32,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1266662511, now seen corresponding path program 1 times [2018-10-27 06:10:32,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:32,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:32,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:32,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash 884452726, now seen corresponding path program 2 times [2018-10-27 06:10:32,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:32,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:32,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:32,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:32,545 INFO L82 PathProgramCache]: Analyzing trace with hash 279194886, now seen corresponding path program 2 times [2018-10-27 06:10:32,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:32,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,771 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-10-27 06:10:33,340 WARN L179 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 153 [2018-10-27 06:10:33,473 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-27 06:10:33,475 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:33,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:33,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:33,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:33,475 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:33,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:33,475 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:33,475 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:33,475 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration8_Lasso [2018-10-27 06:10:33,475 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:33,475 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:33,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,815 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2018-10-27 06:10:33,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:33,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:34,171 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-27 06:10:34,410 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:34,410 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:34,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:34,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:34,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:34,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:34,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:34,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:34,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:34,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:34,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:34,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:34,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:34,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:34,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:34,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:34,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:34,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:34,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,450 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:34,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,451 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:34,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:34,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:34,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:34,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:34,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:34,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:34,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:34,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:34,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:34,466 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:34,467 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:34,468 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:34,468 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:34,468 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:34,469 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:34,469 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-10-27 06:10:34,584 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:34,585 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:34,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:34,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:34,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 06:10:34,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:34,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:34,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 06:10:34,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-10-27 06:10:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:34,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:34,739 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:34,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:34,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:34,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:34,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:34,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:34,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:34,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:34,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:10:34,912 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60 Second operand 10 states. [2018-10-27 06:10:35,114 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60. Second operand 10 states. Result 560 states and 602 transitions. Complement of second has 16 states. [2018-10-27 06:10:35,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:10:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-10-27 06:10:35,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 47 letters. Loop has 18 letters. [2018-10-27 06:10:35,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:35,116 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:35,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:35,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:35,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 06:10:35,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:35,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:35,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 06:10:35,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-10-27 06:10:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:35,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:35,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:35,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:35,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:35,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:35,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:35,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:35,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:35,374 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:10:35,374 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60 Second operand 10 states. [2018-10-27 06:10:35,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60. Second operand 10 states. Result 558 states and 600 transitions. Complement of second has 20 states. [2018-10-27 06:10:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:10:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2018-10-27 06:10:35,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 42 transitions. Stem has 47 letters. Loop has 18 letters. [2018-10-27 06:10:35,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:35,548 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:35,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:35,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:35,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 06:10:35,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:35,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:35,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 06:10:35,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-10-27 06:10:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:35,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:35,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:35,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:35,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:35,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:35,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:35,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:35,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:35,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:35,797 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 7 loop predicates [2018-10-27 06:10:35,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60 Second operand 10 states. [2018-10-27 06:10:35,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60. Second operand 10 states. Result 713 states and 777 transitions. Complement of second has 17 states. [2018-10-27 06:10:35,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:10:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-10-27 06:10:35,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 47 letters. Loop has 18 letters. [2018-10-27 06:10:35,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:35,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 65 letters. Loop has 18 letters. [2018-10-27 06:10:35,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:35,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 47 letters. Loop has 36 letters. [2018-10-27 06:10:35,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:35,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 713 states and 777 transitions. [2018-10-27 06:10:35,999 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 154 [2018-10-27 06:10:36,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 713 states to 538 states and 584 transitions. [2018-10-27 06:10:36,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2018-10-27 06:10:36,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2018-10-27 06:10:36,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 538 states and 584 transitions. [2018-10-27 06:10:36,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:36,002 INFO L705 BuchiCegarLoop]: Abstraction has 538 states and 584 transitions. [2018-10-27 06:10:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states and 584 transitions. [2018-10-27 06:10:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 355. [2018-10-27 06:10:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-27 06:10:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 387 transitions. [2018-10-27 06:10:36,013 INFO L728 BuchiCegarLoop]: Abstraction has 355 states and 387 transitions. [2018-10-27 06:10:36,013 INFO L608 BuchiCegarLoop]: Abstraction has 355 states and 387 transitions. [2018-10-27 06:10:36,013 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:10:36,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 387 transitions. [2018-10-27 06:10:36,015 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 135 [2018-10-27 06:10:36,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:36,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:36,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:36,020 INFO L793 eck$LassoCheckResult]: Stem: 6512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 6453#L554-2 assume true; 6650#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 6701#L551-2 main_#t~short7 := main_#t~mem5 > 0; 6700#L551-3 assume main_#t~short7; 6699#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 6698#L551-5 main_#t~short7 := main_#t~mem6 > 0; 6697#L551-7 main_#t~short9 := main_#t~short7; 6696#L551-8 assume main_#t~short9; 6695#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 6694#L551-10 main_#t~short9 := main_#t~mem8 > 0; 6693#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 6692#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 6691#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 6690#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 6688#L553-2 havoc main_#t~mem11; 6458#L554-2 assume true; 6459#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 6521#L551-2 main_#t~short7 := main_#t~mem5 > 0; 6522#L551-3 assume main_#t~short7; 6485#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 6486#L551-5 main_#t~short7 := main_#t~mem6 > 0; 6493#L551-7 main_#t~short9 := main_#t~short7; 6503#L551-8 assume main_#t~short9; 6755#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 6746#L551-10 main_#t~short9 := main_#t~mem8 > 0; 6470#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 6462#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 6463#L554 [2018-10-27 06:10:36,021 INFO L795 eck$LassoCheckResult]: Loop: 6463#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 6745#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 6744#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 6743#L555-2 havoc main_#t~mem13; 6742#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 6741#L556-1 havoc main_#t~nondet14; 6740#L554-2 assume true; 6739#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 6738#L551-2 main_#t~short7 := main_#t~mem5 > 0; 6737#L551-3 assume main_#t~short7; 6736#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 6735#L551-5 main_#t~short7 := main_#t~mem6 > 0; 6734#L551-7 main_#t~short9 := main_#t~short7; 6733#L551-8 assume main_#t~short9; 6722#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 6721#L551-10 main_#t~short9 := main_#t~mem8 > 0; 6687#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 6532#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 6533#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 6684#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 6516#L553-2 havoc main_#t~mem11; 6517#L554-2 assume true; 6732#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 6731#L551-2 main_#t~short7 := main_#t~mem5 > 0; 6730#L551-3 assume main_#t~short7; 6729#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 6728#L551-5 main_#t~short7 := main_#t~mem6 > 0; 6727#L551-7 main_#t~short9 := main_#t~short7; 6726#L551-8 assume main_#t~short9; 6724#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 6725#L551-10 main_#t~short9 := main_#t~mem8 > 0; 6768#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 6767#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 6463#L554 [2018-10-27 06:10:36,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash 8160422, now seen corresponding path program 1 times [2018-10-27 06:10:36,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:36,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash 971317445, now seen corresponding path program 1 times [2018-10-27 06:10:36,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash -8223552, now seen corresponding path program 3 times [2018-10-27 06:10:36,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:36,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:36,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:36,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:36,324 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 97 [2018-10-27 06:10:36,695 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 118 [2018-10-27 06:10:36,766 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:36,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:36,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:36,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:36,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:36,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:36,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:36,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:36,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration9_Lasso [2018-10-27 06:10:36,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:36,767 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:36,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:36,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,126 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2018-10-27 06:10:37,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:37,712 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:37,712 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:37,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:37,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,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-10-27 06:10:37,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:37,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:37,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:37,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:37,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:10:37,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:37,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:37,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:37,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,752 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:37,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,753 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:10:37,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:37,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,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-10-27 06:10:37,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:37,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:37,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:37,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:37,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:37,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:37,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:37,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:37,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,789 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:37,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,789 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:37,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,801 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:37,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,801 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:37,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:37,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:37,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:37,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-10-27 06:10:37,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:37,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:37,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:37,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:37,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:37,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:37,824 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:37,826 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:10:37,826 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:10:37,827 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:37,835 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:37,836 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:37,836 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2018-10-27 06:10:38,462 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:38,465 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:38,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:38,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:38,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 06:10:38,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:38,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:38,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 06:10:38,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-10-27 06:10:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:38,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:38,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:38,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:38,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:38,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:38,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:38,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:38,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:38,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:38,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2018-10-27 06:10:38,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-10-27 06:10:38,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:38,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:38,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-10-27 06:10:38,707 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:10:38,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:10:38,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:10:38,751 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2018-10-27 06:10:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:38,770 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-10-27 06:10:38,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 387 transitions. cyclomatic complexity: 45 Second operand 12 states. [2018-10-27 06:10:38,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 387 transitions. cyclomatic complexity: 45. Second operand 12 states. Result 461 states and 499 transitions. Complement of second has 16 states. [2018-10-27 06:10:38,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:10:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-10-27 06:10:38,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 29 letters. Loop has 33 letters. [2018-10-27 06:10:38,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:38,964 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:38,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:38,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:38,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-10-27 06:10:39,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:39,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:39,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-27 06:10:39,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-10-27 06:10:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:39,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:39,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:39,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:39,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:39,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:39,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:39,365 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:39,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2018-10-27 06:10:39,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-10-27 06:10:39,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-27 06:10:39,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:39,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-10-27 06:10:39,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:39,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:10:39,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:10:39,478 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2018-10-27 06:10:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,500 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-10-27 06:10:39,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 387 transitions. cyclomatic complexity: 45 Second operand 12 states. [2018-10-27 06:10:39,841 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 387 transitions. cyclomatic complexity: 45. Second operand 12 states. Result 465 states and 505 transitions. Complement of second has 30 states. [2018-10-27 06:10:39,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-27 06:10:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 52 transitions. [2018-10-27 06:10:39,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 52 transitions. Stem has 29 letters. Loop has 33 letters. [2018-10-27 06:10:39,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 52 transitions. Stem has 62 letters. Loop has 33 letters. [2018-10-27 06:10:39,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 52 transitions. Stem has 29 letters. Loop has 66 letters. [2018-10-27 06:10:39,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 505 transitions. [2018-10-27 06:10:39,845 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 113 [2018-10-27 06:10:39,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 407 states and 443 transitions. [2018-10-27 06:10:39,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2018-10-27 06:10:39,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-10-27 06:10:39,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 443 transitions. [2018-10-27 06:10:39,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:39,847 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 443 transitions. [2018-10-27 06:10:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 443 transitions. [2018-10-27 06:10:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 380. [2018-10-27 06:10:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 06:10:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 416 transitions. [2018-10-27 06:10:39,853 INFO L728 BuchiCegarLoop]: Abstraction has 380 states and 416 transitions. [2018-10-27 06:10:39,853 INFO L608 BuchiCegarLoop]: Abstraction has 380 states and 416 transitions. [2018-10-27 06:10:39,853 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:10:39,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 416 transitions. [2018-10-27 06:10:39,854 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 113 [2018-10-27 06:10:39,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:39,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:39,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:39,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:39,855 INFO L793 eck$LassoCheckResult]: Stem: 8377#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 8317#L554-2 assume true; 8412#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 8411#L551-2 main_#t~short7 := main_#t~mem5 > 0; 8410#L551-3 assume main_#t~short7; 8409#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 8408#L551-5 main_#t~short7 := main_#t~mem6 > 0; 8407#L551-7 main_#t~short9 := main_#t~short7; 8406#L551-8 assume main_#t~short9; 8405#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 8404#L551-10 main_#t~short9 := main_#t~mem8 > 0; 8403#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 8402#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 8401#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 8400#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 8398#L553-2 havoc main_#t~mem11; 8397#L554-2 assume true; 8396#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 8395#L551-2 main_#t~short7 := main_#t~mem5 > 0; 8394#L551-3 assume main_#t~short7; 8393#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 8392#L551-5 main_#t~short7 := main_#t~mem6 > 0; 8391#L551-7 main_#t~short9 := main_#t~short7; 8390#L551-8 assume main_#t~short9; 8389#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 8388#L551-10 main_#t~short9 := main_#t~mem8 > 0; 8387#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 8386#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 8385#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 8309#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 8310#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 8313#L555-2 havoc main_#t~mem13; 8359#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 8360#L556-1 havoc main_#t~nondet14; 8322#L554-2 [2018-10-27 06:10:39,856 INFO L795 eck$LassoCheckResult]: Loop: 8322#L554-2 assume true; 8323#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 8382#L551-2 main_#t~short7 := main_#t~mem5 > 0; 8339#L551-3 assume main_#t~short7; 8340#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 8347#L551-5 main_#t~short7 := main_#t~mem6 > 0; 8353#L551-7 main_#t~short9 := main_#t~short7; 8365#L551-8 assume main_#t~short9; 8318#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 8319#L551-10 main_#t~short9 := main_#t~mem8 > 0; 8330#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 8326#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 8327#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 8378#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 8379#L553-2 havoc main_#t~mem11; 8322#L554-2 [2018-10-27 06:10:39,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,856 INFO L82 PathProgramCache]: Analyzing trace with hash 24255465, now seen corresponding path program 4 times [2018-10-27 06:10:39,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:39,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:39,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:39,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:39,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1565181494, now seen corresponding path program 3 times [2018-10-27 06:10:39,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:39,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:39,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash -667919026, now seen corresponding path program 5 times [2018-10-27 06:10:39,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:39,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:39,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:39,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,092 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-10-27 06:10:40,506 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 134 [2018-10-27 06:10:40,803 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-10-27 06:10:40,806 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:40,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:40,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:40,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:40,806 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:40,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:40,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:40,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:40,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration10_Lasso [2018-10-27 06:10:40,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:40,807 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:40,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:40,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:41,778 WARN L179 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-10-27 06:10:41,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:41,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:41,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:41,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,257 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:42,257 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:42,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,266 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:42,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:42,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,278 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:42,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,279 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:10:42,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:42,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,298 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:42,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,298 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:42,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:42,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:42,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:42,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:42,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:42,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:42,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:42,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:42,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:42,357 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:42,357 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:42,357 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:42,358 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:42,358 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:42,358 INFO L519 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)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8 Supporting invariants [] [2018-10-27 06:10:42,628 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:42,629 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:42,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:42,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:42,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:42,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:42,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 06:10:42,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:10:42,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:42,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:42,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:42,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:10:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:42,720 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:42,720 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 380 states and 416 transitions. cyclomatic complexity: 50 Second operand 8 states. [2018-10-27 06:10:43,215 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:10:43,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 380 states and 416 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 850 states and 920 transitions. Complement of second has 15 states. [2018-10-27 06:10:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-10-27 06:10:43,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 35 letters. Loop has 15 letters. [2018-10-27 06:10:43,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:43,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 50 letters. Loop has 15 letters. [2018-10-27 06:10:43,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:43,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 35 letters. Loop has 30 letters. [2018-10-27 06:10:43,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:43,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 920 transitions. [2018-10-27 06:10:43,360 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 128 [2018-10-27 06:10:43,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 735 states and 793 transitions. [2018-10-27 06:10:43,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2018-10-27 06:10:43,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2018-10-27 06:10:43,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 735 states and 793 transitions. [2018-10-27 06:10:43,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:43,370 INFO L705 BuchiCegarLoop]: Abstraction has 735 states and 793 transitions. [2018-10-27 06:10:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states and 793 transitions. [2018-10-27 06:10:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 588. [2018-10-27 06:10:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-27 06:10:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 640 transitions. [2018-10-27 06:10:43,380 INFO L728 BuchiCegarLoop]: Abstraction has 588 states and 640 transitions. [2018-10-27 06:10:43,380 INFO L608 BuchiCegarLoop]: Abstraction has 588 states and 640 transitions. [2018-10-27 06:10:43,380 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:10:43,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 588 states and 640 transitions. [2018-10-27 06:10:43,382 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 128 [2018-10-27 06:10:43,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:43,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:43,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:43,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:43,385 INFO L793 eck$LassoCheckResult]: Stem: 9887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9834#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 9835#L554-2 assume true; 9936#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 10053#L551-2 main_#t~short7 := main_#t~mem5 > 0; 10052#L551-3 assume main_#t~short7; 10051#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 10050#L551-5 main_#t~short7 := main_#t~mem6 > 0; 10049#L551-7 main_#t~short9 := main_#t~short7; 10048#L551-8 assume main_#t~short9; 10047#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 10046#L551-10 main_#t~short9 := main_#t~mem8 > 0; 10045#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 10044#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 10043#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 10042#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 10040#L553-2 havoc main_#t~mem11; 10039#L554-2 assume true; 10038#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 10037#L551-2 main_#t~short7 := main_#t~mem5 > 0; 10036#L551-3 assume main_#t~short7; 10035#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 10034#L551-5 main_#t~short7 := main_#t~mem6 > 0; 10033#L551-7 main_#t~short9 := main_#t~short7; 10032#L551-8 assume main_#t~short9; 10031#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 10030#L551-10 main_#t~short9 := main_#t~mem8 > 0; 10029#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 10028#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 10024#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 10025#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 9867#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 9868#L558-2 havoc main_#t~mem15; 9873#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 9825#L559-1 havoc main_#t~nondet16; 9826#L554-2 assume true; 10167#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 10163#L551-2 main_#t~short7 := main_#t~mem5 > 0; 10159#L551-3 assume main_#t~short7; 10130#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 10131#L551-5 main_#t~short7 := main_#t~mem6 > 0; 10125#L551-7 main_#t~short9 := main_#t~short7; 10126#L551-8 assume main_#t~short9; 10119#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 10120#L551-10 main_#t~short9 := main_#t~mem8 > 0; 10020#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 10021#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 10136#L553 [2018-10-27 06:10:43,386 INFO L795 eck$LassoCheckResult]: Loop: 10136#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 10174#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 10172#L553-2 havoc main_#t~mem11; 10169#L554-2 assume true; 10165#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 10161#L551-2 main_#t~short7 := main_#t~mem5 > 0; 10156#L551-3 assume main_#t~short7; 10153#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 10150#L551-5 main_#t~short7 := main_#t~mem6 > 0; 10148#L551-7 main_#t~short9 := main_#t~short7; 10146#L551-8 assume main_#t~short9; 10144#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 10142#L551-10 main_#t~short9 := main_#t~mem8 > 0; 10140#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 10135#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 10136#L553 [2018-10-27 06:10:43,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:43,386 INFO L82 PathProgramCache]: Analyzing trace with hash -558817930, now seen corresponding path program 2 times [2018-10-27 06:10:43,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:43,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:43,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:43,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:43,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash 280714288, now seen corresponding path program 4 times [2018-10-27 06:10:43,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:43,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:43,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:43,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:43,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2008483355, now seen corresponding path program 3 times [2018-10-27 06:10:43,421 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:43,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:43,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:43,709 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-10-27 06:10:44,254 WARN L179 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 156 [2018-10-27 06:10:44,421 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:44,421 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:44,421 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:44,421 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:44,421 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:44,422 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:44,422 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:44,422 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:44,422 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration11_Lasso [2018-10-27 06:10:44,422 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:44,422 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:44,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,746 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-10-27 06:10:44,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:44,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,226 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:45,227 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:45,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:45,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:45,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:45,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:45,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:45,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:45,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:45,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:45,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:45,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:45,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:45,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:45,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:45,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:45,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:45,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:45,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:45,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:45,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,288 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:45,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,289 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:45,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,304 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:45,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,305 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:45,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,352 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:45,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,353 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:45,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:45,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:45,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:45,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:45,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:45,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:45,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:45,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:45,360 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:45,361 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:45,361 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:45,362 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:45,362 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:45,362 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:45,362 INFO L519 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)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_9 Supporting invariants [] [2018-10-27 06:10:45,773 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:45,774 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:45,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:45,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:45,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:45,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:45,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:45,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:45,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:45,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:45,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:45,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:10:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:45,986 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:45,986 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-10-27 06:10:46,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72. Second operand 7 states. Result 919 states and 989 transitions. Complement of second has 13 states. [2018-10-27 06:10:46,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-10-27 06:10:46,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 47 letters. Loop has 15 letters. [2018-10-27 06:10:46,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:46,054 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:46,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:46,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:46,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:46,140 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:46,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:46,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:46,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:46,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:46,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:46,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:10:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:46,194 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:46,194 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-10-27 06:10:46,286 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72. Second operand 7 states. Result 913 states and 976 transitions. Complement of second has 15 states. [2018-10-27 06:10:46,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2018-10-27 06:10:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 47 letters. Loop has 15 letters. [2018-10-27 06:10:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:46,292 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:46,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:46,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:46,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:46,367 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:46,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:46,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:46,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:46,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:46,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:46,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-10-27 06:10:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:46,425 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:10:46,425 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-10-27 06:10:46,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72. Second operand 7 states. Result 984 states and 1064 transitions. Complement of second has 14 states. [2018-10-27 06:10:46,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-10-27 06:10:46,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 52 transitions. Stem has 47 letters. Loop has 15 letters. [2018-10-27 06:10:46,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:46,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 52 transitions. Stem has 62 letters. Loop has 15 letters. [2018-10-27 06:10:46,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:46,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 52 transitions. Stem has 47 letters. Loop has 30 letters. [2018-10-27 06:10:46,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:46,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 984 states and 1064 transitions. [2018-10-27 06:10:46,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-10-27 06:10:46,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 984 states to 679 states and 731 transitions. [2018-10-27 06:10:46,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-10-27 06:10:46,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2018-10-27 06:10:46,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 679 states and 731 transitions. [2018-10-27 06:10:46,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:46,576 INFO L705 BuchiCegarLoop]: Abstraction has 679 states and 731 transitions. [2018-10-27 06:10:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states and 731 transitions. [2018-10-27 06:10:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 414. [2018-10-27 06:10:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-27 06:10:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 450 transitions. [2018-10-27 06:10:46,583 INFO L728 BuchiCegarLoop]: Abstraction has 414 states and 450 transitions. [2018-10-27 06:10:46,583 INFO L608 BuchiCegarLoop]: Abstraction has 414 states and 450 transitions. [2018-10-27 06:10:46,583 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:10:46,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 450 transitions. [2018-10-27 06:10:46,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-10-27 06:10:46,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:46,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:46,585 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:46,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:46,585 INFO L793 eck$LassoCheckResult]: Stem: 14028#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13978#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 13979#L554-2 assume true; 14107#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14105#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14103#L551-3 assume main_#t~short7; 14101#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14099#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14097#L551-7 main_#t~short9 := main_#t~short7; 14095#L551-8 assume main_#t~short9; 14094#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14092#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14090#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 14088#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14085#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 14005#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 14006#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 14012#L558-2 havoc main_#t~mem15; 13997#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 13998#L559-1 havoc main_#t~nondet16; 14055#L554-2 assume true; 14054#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14053#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14052#L551-3 assume main_#t~short7; 14051#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14050#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14049#L551-7 main_#t~short9 := main_#t~short7; 14048#L551-8 assume main_#t~short9; 14047#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14046#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14044#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 14045#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14157#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 14155#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 14153#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 14152#L555-2 havoc main_#t~mem13; 14151#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 14150#L556-1 havoc main_#t~nondet14; 14147#L554-2 assume true; 14148#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14202#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14200#L551-3 assume main_#t~short7; 14197#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14195#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14193#L551-7 main_#t~short9 := main_#t~short7; 14183#L551-8 assume main_#t~short9; 14180#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14181#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14198#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 14161#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14037#L554 [2018-10-27 06:10:46,585 INFO L795 eck$LassoCheckResult]: Loop: 14037#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 14003#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 14004#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 14011#L558-2 havoc main_#t~mem15; 13996#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 13970#L559-1 havoc main_#t~nondet16; 13971#L554-2 assume true; 14140#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14138#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14136#L551-3 assume main_#t~short7; 14134#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14132#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14130#L551-7 main_#t~short9 := main_#t~short7; 14128#L551-8 assume main_#t~short9; 14124#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14121#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14122#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 14041#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14043#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 14154#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 14146#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 14145#L555-2 havoc main_#t~mem13; 14144#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 14143#L556-1 havoc main_#t~nondet14; 14142#L554-2 assume true; 14141#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14139#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14137#L551-3 assume main_#t~short7; 14135#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14133#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14131#L551-7 main_#t~short9 := main_#t~short7; 14129#L551-8 assume main_#t~short9; 14125#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14126#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14117#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 14118#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14037#L554 [2018-10-27 06:10:46,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1643207681, now seen corresponding path program 2 times [2018-10-27 06:10:46,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:46,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:46,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:46,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash -759674293, now seen corresponding path program 1 times [2018-10-27 06:10:46,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:46,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:46,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1576355657, now seen corresponding path program 3 times [2018-10-27 06:10:46,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:46,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:46,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:46,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:47,377 WARN L179 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 105 [2018-10-27 06:10:48,065 WARN L179 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 161 [2018-10-27 06:10:48,254 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-10-27 06:10:48,257 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:48,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:48,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:48,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:48,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:48,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:48,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:48,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:48,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration12_Lasso [2018-10-27 06:10:48,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:48,258 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:48,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,594 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2018-10-27 06:10:48,714 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2018-10-27 06:10:48,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:48,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:49,101 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:49,102 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:49,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:49,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:49,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:49,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:49,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:49,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:49,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:49,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:49,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:49,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:49,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:49,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:49,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:49,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:49,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:49,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:49,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:49,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:49,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:49,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:49,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:49,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:49,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:49,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:49,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:49,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:49,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:49,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:49,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,152 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:49,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,153 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:49,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,164 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:49,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,164 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:49,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:49,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,186 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:49,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,186 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:49,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:49,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:49,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:49,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:49,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:49,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:49,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:49,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:49,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:49,209 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:49,215 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:10:49,215 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:10:49,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:49,216 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:49,216 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:49,217 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 Supporting invariants [] [2018-10-27 06:10:49,382 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:49,385 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:49,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:49,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:49,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:49,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:10:49,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:49,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:49,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:10:49,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-10-27 06:10:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:49,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:49,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:49,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:10:49,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-10-27 06:10:49,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:10:49,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:49,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-27 06:10:49,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:49,572 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:49,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:49,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-10-27 06:10:49,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:49,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:49,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:49,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2018-10-27 06:10:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:10:49,688 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:10:49,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 414 states and 450 transitions. cyclomatic complexity: 47 Second operand 10 states. [2018-10-27 06:10:49,844 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 414 states and 450 transitions. cyclomatic complexity: 47. Second operand 10 states. Result 796 states and 868 transitions. Complement of second has 15 states. [2018-10-27 06:10:49,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:10:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-10-27 06:10:49,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 50 letters. Loop has 36 letters. [2018-10-27 06:10:49,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:49,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 86 letters. Loop has 36 letters. [2018-10-27 06:10:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:49,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 50 letters. Loop has 72 letters. [2018-10-27 06:10:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:49,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 796 states and 868 transitions. [2018-10-27 06:10:49,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-10-27 06:10:49,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 796 states to 491 states and 534 transitions. [2018-10-27 06:10:49,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-10-27 06:10:49,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-10-27 06:10:49,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 491 states and 534 transitions. [2018-10-27 06:10:49,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:49,855 INFO L705 BuchiCegarLoop]: Abstraction has 491 states and 534 transitions. [2018-10-27 06:10:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states and 534 transitions. [2018-10-27 06:10:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 399. [2018-10-27 06:10:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-27 06:10:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 433 transitions. [2018-10-27 06:10:49,861 INFO L728 BuchiCegarLoop]: Abstraction has 399 states and 433 transitions. [2018-10-27 06:10:49,861 INFO L608 BuchiCegarLoop]: Abstraction has 399 states and 433 transitions. [2018-10-27 06:10:49,861 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:10:49,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 433 transitions. [2018-10-27 06:10:49,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-10-27 06:10:49,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:49,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:49,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:49,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:49,863 INFO L793 eck$LassoCheckResult]: Stem: 15636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15591#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 15592#L554-2 assume true; 15602#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15641#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15610#L551-3 assume main_#t~short7; 15611#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15618#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15622#L551-7 main_#t~short9 := main_#t~short7; 15627#L551-8 assume main_#t~short9; 15593#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15594#L551-10 main_#t~short9 := main_#t~mem8 > 0; 15605#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 15597#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 15598#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 15629#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 15783#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 15782#L558-2 havoc main_#t~mem15; 15780#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 15777#L559-1 havoc main_#t~nondet16; 15778#L554-2 assume true; 15771#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15772#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15767#L551-3 assume main_#t~short7; 15768#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15760#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15761#L551-7 main_#t~short9 := main_#t~short7; 15752#L551-8 assume main_#t~short9; 15753#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15744#L551-10 main_#t~short9 := main_#t~mem8 > 0; 15745#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 15786#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 15716#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 15713#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 15710#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 15707#L555-2 havoc main_#t~mem13; 15705#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 15701#L556-1 havoc main_#t~nondet14; 15697#L554-2 assume true; 15694#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15691#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15688#L551-3 assume main_#t~short7; 15684#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15682#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15680#L551-7 main_#t~short9 := main_#t~short7; 15678#L551-8 assume main_#t~short9; 15675#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15674#L551-10 [2018-10-27 06:10:49,864 INFO L795 eck$LassoCheckResult]: Loop: 15674#L551-10 main_#t~short9 := main_#t~mem8 > 0; 15648#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 15646#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 15644#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 15614#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 15615#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 15620#L558-2 havoc main_#t~mem15; 15608#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 15584#L559-1 havoc main_#t~nondet16; 15585#L554-2 assume true; 15665#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15663#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15661#L551-3 assume main_#t~short7; 15659#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15657#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15655#L551-7 main_#t~short9 := main_#t~short7; 15653#L551-8 assume main_#t~short9; 15649#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15647#L551-10 main_#t~short9 := main_#t~mem8 > 0; 15645#L551-12 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6; 15643#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 15633#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 15634#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 15704#L553-2 havoc main_#t~mem11; 15700#L554-2 assume true; 15696#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15693#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15690#L551-3 assume main_#t~short7; 15686#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15683#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15681#L551-7 main_#t~short9 := main_#t~short7; 15679#L551-8 assume main_#t~short9; 15677#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15674#L551-10 [2018-10-27 06:10:49,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1326707136, now seen corresponding path program 4 times [2018-10-27 06:10:49,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:49,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:49,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1099477065, now seen corresponding path program 1 times [2018-10-27 06:10:49,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:49,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:49,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:49,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210152, now seen corresponding path program 1 times [2018-10-27 06:10:49,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:49,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:50,273 WARN L179 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 98 [2018-10-27 06:10:50,949 WARN L179 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 163 [2018-10-27 06:10:51,113 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-10-27 06:10:51,115 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:51,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:51,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:51,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:51,116 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:51,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:51,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:51,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:51,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration13_Lasso [2018-10-27 06:10:51,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:51,116 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:51,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,488 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-10-27 06:10:51,664 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-10-27 06:10:51,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,881 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-10-27 06:10:52,229 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:52,229 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:52,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,231 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:52,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:52,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:52,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,254 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:52,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,255 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:52,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,262 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:52,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,263 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:52,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,266 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:52,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,267 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:52,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:52,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:52,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:52,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:52,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:52,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:52,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:52,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:52,276 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:52,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:52,279 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:52,280 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:52,280 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:52,280 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:52,280 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_11) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_11 Supporting invariants [] [2018-10-27 06:10:52,543 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:10:52,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:52,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:52,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:52,592 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:52,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:10:52,614 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:52,616 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:52,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:10:52,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-10-27 06:10:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:52,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:52,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:52,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:52,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:52,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:52,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:52,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:52,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:52,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:10:52,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:10:52,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:52,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-10-27 06:10:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:52,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:10:52,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45 Second operand 9 states. [2018-10-27 06:10:53,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45. Second operand 9 states. Result 516 states and 557 transitions. Complement of second has 14 states. [2018-10-27 06:10:53,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:10:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2018-10-27 06:10:53,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 49 transitions. Stem has 47 letters. Loop has 33 letters. [2018-10-27 06:10:53,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:53,199 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:53,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:53,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:53,268 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:53,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:10:53,280 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:53,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:53,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:10:53,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-10-27 06:10:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:53,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:53,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:53,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:53,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:53,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:53,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:53,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:53,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:53,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:10:53,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:10:53,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-10-27 06:10:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:53,416 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:10:53,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45 Second operand 9 states. [2018-10-27 06:10:53,568 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45. Second operand 9 states. Result 597 states and 641 transitions. Complement of second has 18 states. [2018-10-27 06:10:53,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:10:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-10-27 06:10:53,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 66 transitions. Stem has 47 letters. Loop has 33 letters. [2018-10-27 06:10:53,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:53,569 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:53,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:53,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:53,626 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:53,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 06:10:53,641 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:53,643 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:53,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:10:53,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-10-27 06:10:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:53,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:53,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:53,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 06:10:53,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:10:53,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-10-27 06:10:53,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 06:10:53,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:10:53,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-10-27 06:10:53,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-10-27 06:10:53,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:10:53,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:53,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-10-27 06:10:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:53,799 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 6 loop predicates [2018-10-27 06:10:53,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45 Second operand 9 states. [2018-10-27 06:10:54,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45. Second operand 9 states. Result 778 states and 847 transitions. Complement of second has 17 states. [2018-10-27 06:10:54,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:10:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2018-10-27 06:10:54,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 69 transitions. Stem has 47 letters. Loop has 33 letters. [2018-10-27 06:10:54,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:54,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 69 transitions. Stem has 80 letters. Loop has 33 letters. [2018-10-27 06:10:54,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:54,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 69 transitions. Stem has 47 letters. Loop has 66 letters. [2018-10-27 06:10:54,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:54,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 778 states and 847 transitions. [2018-10-27 06:10:54,625 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:54,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 778 states to 0 states and 0 transitions. [2018-10-27 06:10:54,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:54,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:54,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:54,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:54,626 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:54,626 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:54,626 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:54,626 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:10:54,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:54,626 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:54,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:54,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:54 BoogieIcfgContainer [2018-10-27 06:10:54,641 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:54,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:54,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:54,641 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:54,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:16" (3/4) ... [2018-10-27 06:10:54,651 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:54,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:54,652 INFO L168 Benchmark]: Toolchain (without parser) took 38838.46 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 555.2 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -111.5 MB). Peak memory consumption was 443.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:54,656 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:54,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:54,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:54,658 INFO L168 Benchmark]: Boogie Preprocessor took 25.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:54,658 INFO L168 Benchmark]: RCFGBuilder took 620.49 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:54,658 INFO L168 Benchmark]: BuchiAutomizer took 37679.22 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 421.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.4 MB). Peak memory consumption was 456.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:54,659 INFO L168 Benchmark]: Witness Printer took 10.45 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:54,668 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.28 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 620.49 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 37679.22 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 421.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.4 MB). Peak memory consumption was 456.4 MB. Max. memory is 11.5 GB. * Witness Printer took 10.45 ms. Allocated memory is still 1.6 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (2 trivial, 8 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 16 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.6s and 14 iterations. TraceHistogramMax:3. Analysis of lassos took 27.8s. Construction of modules took 2.0s. Büchi inclusion checks took 7.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 767 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 588 states and ocurred in iteration 10. Nontrivial modules had stage [7, 1, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/37 HoareTripleCheckerStatistics: 665 SDtfs, 1081 SDslu, 1035 SDs, 0 SdLazy, 1203 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso11 LassoPreprocessingBenchmarks: Lassos: inital391 mio100 ax105 hnf100 lsp90 ukn72 mio100 lsp39 div100 bol100 ite100 ukn100 eq198 hnf87 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...