./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/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 0d5c046770a708e0857845f9429def45b08d1347 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 13:27:33,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 13:27:33,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 13:27:33,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 13:27:33,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 13:27:33,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 13:27:33,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 13:27:33,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 13:27:33,209 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 13:27:33,209 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 13:27:33,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 13:27:33,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 13:27:33,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 13:27:33,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 13:27:33,211 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 13:27:33,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 13:27:33,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 13:27:33,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 13:27:33,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 13:27:33,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 13:27:33,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 13:27:33,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 13:27:33,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 13:27:33,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 13:27:33,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 13:27:33,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 13:27:33,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 13:27:33,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 13:27:33,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 13:27:33,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 13:27:33,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 13:27:33,220 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 13:27:33,220 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 13:27:33,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 13:27:33,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 13:27:33,221 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 13:27:33,221 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 13:27:33,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 13:27:33,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 13:27:33,229 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 13:27:33,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 13:27:33,229 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 13:27:33,229 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 13:27:33,229 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 13:27:33,229 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 13:27:33,229 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 13:27:33,229 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 13:27:33,229 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 13:27:33,230 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 13:27:33,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 13:27:33,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 13:27:33,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 13:27:33,231 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 13:27:33,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 13:27:33,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 13:27:33,231 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 13:27:33,231 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 13:27:33,232 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_4b7b077d-92a4-486e-a49c-25a1cee90bab/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 -> 0d5c046770a708e0857845f9429def45b08d1347 [2018-12-08 13:27:33,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 13:27:33,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 13:27:33,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 13:27:33,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 13:27:33,261 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 13:27:33,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-12-08 13:27:33,304 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/data/8edf9770b/80f57498f12f4fd5b2967ee77d5f9858/FLAG1524e28c2 [2018-12-08 13:27:33,618 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 13:27:33,619 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-12-08 13:27:33,626 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/data/8edf9770b/80f57498f12f4fd5b2967ee77d5f9858/FLAG1524e28c2 [2018-12-08 13:27:33,634 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/bin-2019/uautomizer/data/8edf9770b/80f57498f12f4fd5b2967ee77d5f9858 [2018-12-08 13:27:33,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 13:27:33,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 13:27:33,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 13:27:33,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 13:27:33,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 13:27:33,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33, skipping insertion in model container [2018-12-08 13:27:33,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 13:27:33,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 13:27:33,814 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:27:33,820 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 13:27:33,873 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:27:33,899 INFO L195 MainTranslator]: Completed translation [2018-12-08 13:27:33,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33 WrapperNode [2018-12-08 13:27:33,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 13:27:33,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 13:27:33,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 13:27:33,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 13:27:33,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 13:27:33,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 13:27:33,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 13:27:33,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 13:27:33,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... [2018-12-08 13:27:33,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 13:27:33,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 13:27:33,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 13:27:33,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 13:27:33,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b7b077d-92a4-486e-a49c-25a1cee90bab/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-12-08 13:27:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 13:27:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 13:27:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 13:27:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 13:27:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 13:27:33,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 13:27:34,101 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 13:27:34,101 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 13:27:34,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:27:34 BoogieIcfgContainer [2018-12-08 13:27:34,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 13:27:34,101 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 13:27:34,101 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 13:27:34,104 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 13:27:34,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:27:34,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 01:27:33" (1/3) ... [2018-12-08 13:27:34,105 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b51b665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 01:27:34, skipping insertion in model container [2018-12-08 13:27:34,105 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:27:34,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:27:33" (2/3) ... [2018-12-08 13:27:34,106 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b51b665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 01:27:34, skipping insertion in model container [2018-12-08 13:27:34,106 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 13:27:34,106 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:27:34" (3/3) ... [2018-12-08 13:27:34,107 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-12-08 13:27:34,141 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 13:27:34,141 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 13:27:34,141 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 13:27:34,141 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 13:27:34,141 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 13:27:34,142 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 13:27:34,142 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 13:27:34,142 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 13:27:34,142 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 13:27:34,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 13:27:34,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 13:27:34,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:27:34,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:27:34,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 13:27:34,168 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:27:34,168 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 13:27:34,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 13:27:34,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 13:27:34,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:27:34,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:27:34,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 13:27:34,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:27:34,173 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, 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_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L552-2true [2018-12-08 13:27:34,174 INFO L796 eck$LassoCheckResult]: Loop: 11#L552-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 12#L551-1true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4#L551-3true main_#t~short9 := main_#t~short7; 7#L551-4true assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 10#L551-6true assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 8#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 11#L552-2true [2018-12-08 13:27:34,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 13:27:34,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:34,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:34,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:34,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:34,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-12-08 13:27:34,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:34,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:34,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:34,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:34,281 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-12-08 13:27:34,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:34,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:34,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:34,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:34,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:34,478 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-08 13:27:34,618 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:27:34,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:27:34,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:27:34,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:27:34,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:27:34,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:27:34,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:27:34,619 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:27:34,619 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-08 13:27:34,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:27:34,620 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:27:34,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:34,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-12-08 13:27:34,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:35,177 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:27:35,179 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:27:35,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,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-12-08 13:27:35,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,186 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 13:27:35,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,186 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 13:27:35,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,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-12-08 13:27:35,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:35,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:35,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:35,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:35,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:35,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:35,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,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-12-08 13:27:35,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,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-12-08 13:27:35,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:35,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:35,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:35,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:35,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:35,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:35,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:35,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:35,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-12-08 13:27:35,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:35,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:35,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:35,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:35,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:35,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:35,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:35,268 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:27:35,272 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:27:35,272 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:27:35,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:27:35,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 13:27:35,274 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:27:35,274 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-12-08 13:27:35,331 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 13:27:35,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 13:27:35,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:35,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:35,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:35,421 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 13:27:35,421 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-12-08 13:27:35,489 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 55 states and 71 transitions. Complement of second has 10 states. [2018-12-08 13:27:35,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 13:27:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 13:27:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-12-08 13:27:35,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-08 13:27:35,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:35,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 13:27:35,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:35,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-08 13:27:35,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:35,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 71 transitions. [2018-12-08 13:27:35,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-08 13:27:35,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 31 states and 44 transitions. [2018-12-08 13:27:35,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 13:27:35,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 13:27:35,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2018-12-08 13:27:35,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:27:35,502 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-12-08 13:27:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2018-12-08 13:27:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-08 13:27:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-08 13:27:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-12-08 13:27:35,520 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-12-08 13:27:35,520 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-12-08 13:27:35,520 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 13:27:35,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. [2018-12-08 13:27:35,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-08 13:27:35,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:27:35,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:27:35,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 13:27:35,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:27:35,521 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 228#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, 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_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 229#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 242#L551-1 [2018-12-08 13:27:35,521 INFO L796 eck$LassoCheckResult]: Loop: 242#L551-1 assume !main_#t~short7; 224#L551-3 main_#t~short9 := main_#t~short7; 225#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 231#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 243#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 244#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 242#L551-1 [2018-12-08 13:27:35,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 13:27:35,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:35,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:35,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2018-12-08 13:27:35,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:35,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:35,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:35,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:35,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 13:27:35,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 13:27:35,561 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 13:27:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 13:27:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 13:27:35,564 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-12-08 13:27:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 13:27:35,583 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-08 13:27:35,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 13:27:35,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-12-08 13:27:35,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 13:27:35,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2018-12-08 13:27:35,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-08 13:27:35,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 13:27:35,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-08 13:27:35,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:27:35,585 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-08 13:27:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-08 13:27:35,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-08 13:27:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-08 13:27:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-08 13:27:35,587 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-08 13:27:35,587 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-08 13:27:35,587 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 13:27:35,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-08 13:27:35,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 13:27:35,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:27:35,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:27:35,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:27:35,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:27:35,588 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, 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_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 296#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 311#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 297#L551-3 main_#t~short9 := main_#t~short7; 298#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 309#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 305#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 306#L552-2 [2018-12-08 13:27:35,588 INFO L796 eck$LassoCheckResult]: Loop: 306#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 310#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 314#L551-3 main_#t~short9 := main_#t~short7; 301#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 302#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 313#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 306#L552-2 [2018-12-08 13:27:35,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-12-08 13:27:35,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:35,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-12-08 13:27:35,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:35,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2018-12-08 13:27:35,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:27:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:35,770 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-08 13:27:36,052 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 97 [2018-12-08 13:27:36,114 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:27:36,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:27:36,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:27:36,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:27:36,114 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:27:36,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:27:36,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:27:36,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:27:36,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 13:27:36,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:27:36,115 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:27:36,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:36,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-12-08 13:27:36,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-12-08 13:27:36,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-12-08 13:27:36,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-12-08 13:27:36,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-12-08 13:27:36,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:36,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-12-08 13:27:36,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-12-08 13:27:36,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:36,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-12-08 13:27:36,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-12-08 13:27:36,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-12-08 13:27:36,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:36,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:36,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:36,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:36,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:36,569 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:27:36,569 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:27:36,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:36,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:36,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:36,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,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-12-08 13:27:36,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,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-12-08 13:27:36,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:36,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:36,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:36,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:36,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:36,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:36,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,588 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:36,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,590 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:36,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,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-12-08 13:27:36,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,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-12-08 13:27:36,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,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-12-08 13:27:36,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,617 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:36,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,619 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:36,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,622 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:36,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,623 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:36,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:36,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:36,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:36,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:36,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:36,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:36,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:36,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:36,634 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:27:36,635 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:27:36,635 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:27:36,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:27:36,636 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 13:27:36,637 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:27:36,637 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-12-08 13:27:36,682 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 13:27:36,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 13:27:36,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:36,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:36,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:36,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 13:27:36,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:36,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:36,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 13:27:36,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:36,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:36,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:36,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 13:27:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:36,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:36,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-08 13:27:36,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-08 13:27:36,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2018-12-08 13:27:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 13:27:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 13:27:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-08 13:27:36,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 13:27:36,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:36,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 13:27:36,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:36,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 12 letters. [2018-12-08 13:27:36,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:36,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-12-08 13:27:36,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 13:27:36,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2018-12-08 13:27:36,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 13:27:36,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 13:27:36,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-12-08 13:27:36,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:27:36,830 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-08 13:27:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-12-08 13:27:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-08 13:27:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 13:27:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-08 13:27:36,833 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-08 13:27:36,833 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-08 13:27:36,833 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 13:27:36,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-12-08 13:27:36,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-08 13:27:36,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:27:36,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:27:36,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-12-08 13:27:36,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:27:36,834 INFO L794 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 521#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, 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_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 522#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 540#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 539#L551-3 main_#t~short9 := main_#t~short7; 538#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 537#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 536#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 535#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 531#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 517#L551-3 main_#t~short9 := main_#t~short7; 518#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 523#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 526#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 527#L552-2 [2018-12-08 13:27:36,834 INFO L796 eck$LassoCheckResult]: Loop: 527#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 533#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 548#L551-3 main_#t~short9 := main_#t~short7; 546#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 544#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 542#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 527#L552-2 [2018-12-08 13:27:36,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash -692497895, now seen corresponding path program 2 times [2018-12-08 13:27:36,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:36,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:36,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2018-12-08 13:27:36,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:36,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:36,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:36,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:27:36,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:36,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:36,870 INFO L82 PathProgramCache]: Analyzing trace with hash 502600418, now seen corresponding path program 2 times [2018-12-08 13:27:36,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:36,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:36,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:36,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:27:36,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:37,574 WARN L180 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 134 [2018-12-08 13:27:37,784 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-08 13:27:37,787 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:27:37,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:27:37,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:27:37,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:27:37,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:27:37,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:27:37,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:27:37,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:27:37,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-08 13:27:37,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:27:37,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:27:37,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-12-08 13:27:37,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,269 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:27:38,269 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:27:38,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-12-08 13:27:38,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:38,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:38,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:38,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:38,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,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-12-08 13:27:38,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,271 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:38,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,272 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:38,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:38,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:38,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:38,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:38,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,277 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:38,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,278 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:38,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,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-12-08 13:27:38,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,280 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:38,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,280 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:38,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,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-12-08 13:27:38,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:38,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:38,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,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-12-08 13:27:38,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:38,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:38,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:38,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:38,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:38,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,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-12-08 13:27:38,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:38,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:38,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:38,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:38,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:38,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:38,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:38,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:38,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:38,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:38,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:38,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:38,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:38,295 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:27:38,297 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:27:38,297 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:27:38,297 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:27:38,297 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 13:27:38,298 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:27:38,298 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-12-08 13:27:38,345 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 13:27:38,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 13:27:38,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:38,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:38,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 13:27:38,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 13:27:38,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 13:27:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:38,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:38,427 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-08 13:27:38,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-08 13:27:38,465 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 8 states. [2018-12-08 13:27:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 13:27:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 13:27:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-08 13:27:38,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 13:27:38,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:38,466 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:27:38,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:38,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:38,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 13:27:38,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 13:27:38,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 13:27:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:38,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:38,541 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-08 13:27:38,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-08 13:27:38,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 8 states. [2018-12-08 13:27:38,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 13:27:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 13:27:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-08 13:27:38,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 13:27:38,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:38,577 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:27:38,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:38,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:38,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 13:27:38,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:38,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 13:27:38,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:38,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 13:27:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:38,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:38,652 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 3 loop predicates [2018-12-08 13:27:38,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-08 13:27:38,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 56 transitions. Complement of second has 7 states. [2018-12-08 13:27:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 13:27:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 13:27:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-08 13:27:38,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 13:27:38,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:38,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 20 letters. Loop has 6 letters. [2018-12-08 13:27:38,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:38,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 12 letters. [2018-12-08 13:27:38,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:38,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-12-08 13:27:38,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-08 13:27:38,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 44 transitions. [2018-12-08 13:27:38,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 13:27:38,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 13:27:38,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2018-12-08 13:27:38,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:27:38,699 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-12-08 13:27:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2018-12-08 13:27:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 14. [2018-12-08 13:27:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-08 13:27:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-08 13:27:38,700 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-08 13:27:38,700 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-08 13:27:38,700 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 13:27:38,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-12-08 13:27:38,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-08 13:27:38,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:27:38,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:27:38,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 13:27:38,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:27:38,701 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1020#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, 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_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1021#L552-2 [2018-12-08 13:27:38,701 INFO L796 eck$LassoCheckResult]: Loop: 1021#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1028#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1016#L551-3 main_#t~short9 := main_#t~short7; 1017#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1022#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 1025#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1021#L552-2 [2018-12-08 13:27:38,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-08 13:27:38,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:38,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:38,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:27:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:38,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577164, now seen corresponding path program 1 times [2018-12-08 13:27:38,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:38,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:38,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:38,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:27:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:38,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:38,715 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 3 times [2018-12-08 13:27:38,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:38,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:38,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:27:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:38,850 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-12-08 13:27:38,941 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:27:38,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:27:38,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:27:38,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:27:38,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:27:38,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:27:38,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:27:38,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:27:38,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-08 13:27:38,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:27:38,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:27:38,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:38,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:39,308 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:27:39,308 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:27:39,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-12-08 13:27:39,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:39,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:39,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,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-12-08 13:27:39,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:39,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:39,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:39,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:39,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:39,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:39,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:39,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:39,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:39,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:39,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:39,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:39,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:39,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:39,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,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-12-08 13:27:39,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:39,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:39,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,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-12-08 13:27:39,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,319 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:39,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,319 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:39,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:39,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,323 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:39,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,323 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:39,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:39,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:39,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:39,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:39,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:39,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:39,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:39,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:39,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:39,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:39,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:39,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:39,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:39,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:39,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:39,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:39,338 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:27:39,339 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:27:39,340 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:27:39,340 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:27:39,340 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 13:27:39,340 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:27:39,340 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_4 Supporting invariants [] [2018-12-08 13:27:39,385 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 13:27:39,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 13:27:39,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:39,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:39,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:39,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 13:27:39,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-08 13:27:39,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 36 states and 42 transitions. Complement of second has 9 states. [2018-12-08 13:27:39,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 13:27:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 13:27:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-08 13:27:39,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-08 13:27:39,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:39,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 13:27:39,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:39,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-08 13:27:39,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:39,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2018-12-08 13:27:39,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-08 13:27:39,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 30 transitions. [2018-12-08 13:27:39,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 13:27:39,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 13:27:39,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-12-08 13:27:39,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:27:39,468 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-08 13:27:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-12-08 13:27:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-12-08 13:27:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-08 13:27:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-08 13:27:39,469 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-08 13:27:39,469 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-08 13:27:39,469 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 13:27:39,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-08 13:27:39,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-08 13:27:39,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:27:39,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:27:39,469 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:27:39,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 13:27:39,470 INFO L794 eck$LassoCheckResult]: Stem: 1225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1219#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, 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_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1220#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1233#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1223#L551-3 main_#t~short9 := main_#t~short7; 1224#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1227#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 1230#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1231#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1235#L551-1 [2018-12-08 13:27:39,470 INFO L796 eck$LassoCheckResult]: Loop: 1235#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1221#L551-3 main_#t~short9 := main_#t~short7; 1222#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1226#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 1228#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1229#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1235#L551-1 [2018-12-08 13:27:39,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2018-12-08 13:27:39,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:39,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:39,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:39,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:27:39,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:39,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2018-12-08 13:27:39,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:39,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:39,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:39,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:27:39,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:39,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 3 times [2018-12-08 13:27:39,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:27:39,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:27:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:39,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:27:39,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:27:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:27:39,660 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-12-08 13:27:39,764 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-08 13:27:40,015 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2018-12-08 13:27:40,433 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2018-12-08 13:27:40,438 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:27:40,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:27:40,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:27:40,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:27:40,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:27:40,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:27:40,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:27:40,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:27:40,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-08 13:27:40,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:27:40,438 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:27:40,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,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-12-08 13:27:40,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,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-12-08 13:27:40,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,754 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2018-12-08 13:27:40,953 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-12-08 13:27:40,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:40,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:27:41,258 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:27:41,258 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:27:41,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-12-08 13:27:41,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:41,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:41,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:41,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:41,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:41,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:41,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:41,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:41,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:41,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-12-08 13:27:41,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:41,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:41,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:41,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:41,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:41,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:41,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:41,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:41,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:41,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-12-08 13:27:41,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:27:41,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:41,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:27:41,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:27:41,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:41,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-12-08 13:27:41,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,266 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:41,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,266 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:41,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:41,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:41,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:27:41,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:41,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:41,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:41,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:41,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-12-08 13:27:41,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,272 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 13:27:41,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,273 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 13:27:41,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:41,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:27:41,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-12-08 13:27:41,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:27:41,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:27:41,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:27:41,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:27:41,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:27:41,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:27:41,278 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:27:41,280 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:27:41,280 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:27:41,280 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:27:41,280 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 13:27:41,281 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:27:41,281 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_5 Supporting invariants [] [2018-12-08 13:27:41,346 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 13:27:41,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 13:27:41,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:41,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:41,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 13:27:41,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:41,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:41,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 13:27:41,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 13:27:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:41,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:41,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2018-12-08 13:27:41,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 13:27:41,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:41,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-12-08 13:27:41,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-08 13:27:41,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:41,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:41,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:41,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:41,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,508 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:41,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2018-12-08 13:27:42,110 WARN L180 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-08 13:27:42,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-12-08 13:27:42,113 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:42,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-12-08 13:27:42,115 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:42,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-12-08 13:27:42,118 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:42,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-12-08 13:27:42,483 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:42,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 88 [2018-12-08 13:27:42,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 81 treesize of output 74 [2018-12-08 13:27:42,841 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:42,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-12-08 13:27:42,902 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:42,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 91 [2018-12-08 13:27:42,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,959 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:27:42,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:42,965 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 100 [2018-12-08 13:27:42,966 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:42,979 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-12-08 13:27:43,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:43,023 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,033 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-08 13:27:43,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:43,072 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,078 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,090 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2018-12-08 13:27:43,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-08 13:27:43,100 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-12-08 13:27:43,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:43,114 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,118 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,124 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-12-08 13:27:43,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-08 13:27:43,132 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:43,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-08 13:27:43,146 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,150 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,156 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-12-08 13:27:43,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-08 13:27:43,277 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-12-08 13:27:43,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:43,291 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,295 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,300 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,356 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:27:43,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2018-12-08 13:27:43,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 13:27:43,395 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-12-08 13:27:43,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-12-08 13:27:43,443 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-12-08 13:27:43,497 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 87 [2018-12-08 13:27:43,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:27:43,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,548 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-12-08 13:27:43,548 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,561 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-08 13:27:43,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:43,597 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,603 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-12-08 13:27:43,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:43,632 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,637 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,647 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-12-08 13:27:43,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-08 13:27:43,657 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-12-08 13:27:43,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:43,670 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,674 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,679 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-12-08 13:27:43,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-08 13:27:43,687 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:43,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-08 13:27:43,704 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,708 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,716 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,734 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:27:43,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:27:43,769 INFO L202 ElimStorePlain]: Needed 52 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-12-08 13:27:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:43,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-08 13:27:43,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-08 13:27:43,815 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 38 states and 44 transitions. Complement of second has 10 states. [2018-12-08 13:27:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 13:27:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 13:27:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-08 13:27:43,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-08 13:27:43,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:43,816 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:27:43,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:43,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:43,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 13:27:43,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 13:27:43,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 13:27:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:43,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:43,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2018-12-08 13:27:43,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 13:27:43,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:43,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:43,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-12-08 13:27:44,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-08 13:27:44,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-12-08 13:27:44,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:44,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,027 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-12-08 13:27:44,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-08 13:27:44,040 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:44,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-08 13:27:44,055 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,060 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,065 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-12-08 13:27:44,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-12-08 13:27:44,088 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-12-08 13:27:44,141 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-12-08 13:27:44,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:44,185 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,194 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 70 [2018-12-08 13:27:44,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:44,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-12-08 13:27:44,250 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-08 13:27:44,280 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,294 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:27:44,305 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:27:44,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2018-12-08 13:27:44,899 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-08 13:27:44,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-12-08 13:27:44,901 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-12-08 13:27:44,903 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:44,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-12-08 13:27:44,905 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-12-08 13:27:45,333 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-12-08 13:27:45,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-08 13:27:45,695 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-12-08 13:27:45,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:45,707 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,711 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,716 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-12-08 13:27:45,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-08 13:27:45,948 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:45,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-08 13:27:45,964 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,968 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,973 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:45,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:45,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 99 [2018-12-08 13:27:46,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:46,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 81 treesize of output 74 [2018-12-08 13:27:46,003 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:46,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:46,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2018-12-08 13:27:46,882 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:47,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:47,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-12-08 13:27:47,991 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:48,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 91 [2018-12-08 13:27:48,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,543 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:27:48,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,549 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-12-08 13:27:48,549 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:48,571 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:48,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-08 13:27:48,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:48,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:48,903 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:48,910 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-08 13:27:49,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:49,170 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,176 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-12-08 13:27:49,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:49,292 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,298 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,324 INFO L267 ElimStorePlain]: Start of recursive call 33: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2018-12-08 13:27:49,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-12-08 13:27:49,343 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-08 13:27:49,394 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-12-08 13:27:49,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:49,445 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,451 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-08 13:27:49,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:49,492 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,499 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,512 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,579 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:27:49,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2018-12-08 13:27:49,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 13:27:49,611 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-12-08 13:27:49,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-08 13:27:49,627 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:49,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:49,640 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,644 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,648 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,653 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:27:49,689 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-12-08 13:27:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:27:49,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-08 13:27:49,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-08 13:27:49,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 35 states and 39 transitions. Complement of second has 12 states. [2018-12-08 13:27:49,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-08 13:27:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 13:27:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-08 13:27:49,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-08 13:27:49,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:27:49,745 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 13:27:49,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:27:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:49,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:49,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-08 13:27:49,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 13:27:49,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 13:27:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:27:49,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:27:49,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2018-12-08 13:27:49,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 13:27:49,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-12-08 13:27:49,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-08 13:27:49,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:49,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:49,910 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,914 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2018-12-08 13:27:49,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 13:27:49,962 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:49,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-12-08 13:27:49,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:49,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-08 13:27:49,999 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-12-08 13:27:50,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:50,012 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,016 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,020 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-12-08 13:27:50,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-08 13:27:50,028 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:50,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-08 13:27:50,047 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,051 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,056 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2018-12-08 13:27:50,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-12-08 13:27:50,078 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-12-08 13:27:50,139 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-08 13:27:50,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:50,188 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,194 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 87 [2018-12-08 13:27:50,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,231 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:27:50,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,237 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-12-08 13:27:50,238 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,251 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-12-08 13:27:50,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:50,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:50,283 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,288 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,300 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:50,317 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:27:50,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2018-12-08 13:27:51,026 WARN L180 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-08 13:27:51,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-12-08 13:27:51,029 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:51,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-12-08 13:27:51,031 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:51,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-12-08 13:27:51,033 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:51,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-12-08 13:27:51,472 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:51,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:51,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:51,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 111 [2018-12-08 13:27:51,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:51,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 94 [2018-12-08 13:27:51,869 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:52,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:52,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 92 [2018-12-08 13:27:52,666 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-12-08 13:27:53,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:53,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2018-12-08 13:27:53,300 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:54,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:54,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:54,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:54,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2018-12-08 13:27:54,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:54,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:54,533 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:27:54,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:54,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:54,548 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2018-12-08 13:27:54,549 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-12-08 13:27:54,584 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:27:55,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:55,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-08 13:27:55,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:55,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:55,771 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:55,778 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:56,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2018-12-08 13:27:56,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:56,168 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:56,179 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:56,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 117 [2018-12-08 13:27:56,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 95 [2018-12-08 13:27:56,396 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:56,436 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:27:56,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 90 [2018-12-08 13:27:56,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,595 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 83 [2018-12-08 13:27:56,596 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:27:56,609 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 13:27:56,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 84 [2018-12-08 13:27:56,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,626 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 74 [2018-12-08 13:27:56,628 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 13:27:56,658 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 13:27:56,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-12-08 13:27:56,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:56,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:56,955 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:56,966 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,148 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts. [2018-12-08 13:27:57,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2018-12-08 13:27:57,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2018-12-08 13:27:57,170 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-08 13:27:57,225 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-12-08 13:27:57,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:57,274 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,283 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-08 13:27:57,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:57,322 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,328 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 77 [2018-12-08 13:27:57,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:27:57,365 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,374 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,390 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:27:57,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 83 [2018-12-08 13:27:57,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-12-08 13:27:57,400 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 84 [2018-12-08 13:27:57,428 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 71 [2018-12-08 13:27:57,429 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 13:27:57,442 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,449 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-12-08 13:27:57,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-08 13:27:57,693 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-12-08 13:27:57,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-08 13:27:57,708 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,713 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,719 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:27:57,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 99 [2018-12-08 13:27:57,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:57,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-12-08 13:27:57,753 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:58,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:58,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 67 treesize of output 70 [2018-12-08 13:27:58,479 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:59,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:59,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-12-08 13:27:59,471 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-08 13:27:59,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:59,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:59,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:27:59,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2018-12-08 13:27:59,960 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:00,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2018-12-08 13:28:00,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,379 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 13:28:00,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,394 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2018-12-08 13:28:00,395 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-12-08 13:28:00,429 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:28:00,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-12-08 13:28:00,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:00,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:28:00,742 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:00,749 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-08 13:28:01,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:28:01,004 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,011 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 70 [2018-12-08 13:28:01,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-12-08 13:28:01,126 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-08 13:28:01,156 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,174 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:28:01,192 INFO L267 ElimStorePlain]: Start of recursive call 67: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2018-12-08 13:28:01,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-12-08 13:28:01,212 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 61 [2018-12-08 13:28:01,266 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2018-12-08 13:28:01,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:28:01,310 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,315 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-12-08 13:28:01,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:28:01,354 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,363 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-12-08 13:28:01,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:01,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:28:01,396 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,401 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,412 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:01,465 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:28:01,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 13:28:01,500 INFO L202 ElimStorePlain]: Needed 89 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-12-08 13:28:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:28:01,513 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-08 13:28:01,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-08 13:28:01,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 46 states and 53 transitions. Complement of second has 11 states. [2018-12-08 13:28:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 13:28:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 13:28:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-12-08 13:28:01,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-08 13:28:01,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:28:01,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-08 13:28:01,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:28:01,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2018-12-08 13:28:01,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:28:01,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2018-12-08 13:28:01,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 13:28:01,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 25 states and 29 transitions. [2018-12-08 13:28:01,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-08 13:28:01,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-12-08 13:28:01,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-12-08 13:28:01,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 13:28:01,546 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-08 13:28:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-12-08 13:28:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-08 13:28:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-08 13:28:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-08 13:28:01,547 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-08 13:28:01,547 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-08 13:28:01,547 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 13:28:01,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-12-08 13:28:01,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-08 13:28:01,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 13:28:01,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 13:28:01,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 13:28:01,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2018-12-08 13:28:01,548 INFO L794 eck$LassoCheckResult]: Stem: 1670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1666#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, 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_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1667#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1675#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1681#L551-3 main_#t~short9 := main_#t~short7; 1680#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1679#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 1678#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1677#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1676#L551-1 [2018-12-08 13:28:01,548 INFO L796 eck$LassoCheckResult]: Loop: 1676#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1668#L551-3 main_#t~short9 := main_#t~short7; 1669#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1671#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 1672#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1673#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1675#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1681#L551-3 main_#t~short9 := main_#t~short7; 1680#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1679#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~short9; 1678#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1677#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1676#L551-1 [2018-12-08 13:28:01,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:28:01,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 3 times [2018-12-08 13:28:01,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:28:01,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:28:01,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:28:01,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:28:01,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:28:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:28:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:28:01,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:28:01,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1005496147, now seen corresponding path program 1 times [2018-12-08 13:28:01,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:28:01,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:28:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:28:01,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 13:28:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:28:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:28:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:28:01,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:28:01,564 INFO L82 PathProgramCache]: Analyzing trace with hash -588138969, now seen corresponding path program 4 times [2018-12-08 13:28:01,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 13:28:01,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 13:28:01,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:28:01,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 13:28:01,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 13:28:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:28:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:28:01,937 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2018-12-08 13:28:02,358 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2018-12-08 13:28:02,598 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2018-12-08 13:28:03,057 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-12-08 13:28:03,060 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 13:28:03,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 13:28:03,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 13:28:03,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 13:28:03,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 13:28:03,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 13:28:03,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 13:28:03,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 13:28:03,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-08 13:28:03,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 13:28:03,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 13:28:03,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,380 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2018-12-08 13:28:03,594 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-12-08 13:28:03,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 13:28:03,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 13:28:03,888 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 13:28:03,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:28:03,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:28:03,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:28:03,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:28:03,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:28:03,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:28:03,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:28:03,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:28:03,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:28:03,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,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-12-08 13:28:03,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:28:03,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:28:03,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:28:03,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:28:03,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:28:03,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:28:03,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,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-12-08 13:28:03,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 13:28:03,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 13:28:03,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 13:28:03,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 13:28:03,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 13:28:03,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 13:28:03,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 13:28:03,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 13:28:03,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 13:28:03,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 13:28:03,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 13:28:03,924 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 13:28:03,925 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 13:28:03,925 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 13:28:03,925 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 13:28:03,925 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 13:28:03,925 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 13:28:03,925 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-12-08 13:28:03,993 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 13:28:03,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 13:28:04,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:28:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:28:04,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:28:04,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 13:28:04,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 13:28:04,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-08 13:28:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:28:04,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 13:28:04,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 86 [2018-12-08 13:28:04,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 13:28:04,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2018-12-08 13:28:04,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-08 13:28:04,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 69 [2018-12-08 13:28:04,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 62 [2018-12-08 13:28:04,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-08 13:28:04,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-12-08 13:28:04,258 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,278 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:28:04,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:28:04,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:28:04,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 13:28:04,329 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:154, output treesize:93 [2018-12-08 13:28:04,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-12-08 13:28:04,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 13:28:04,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-08 13:28:04,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-08 13:28:04,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 13:28:04,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 13:28:04,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2018-12-08 13:28:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 13:28:04,385 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-08 13:28:04,385 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-12-08 13:28:04,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 58 states and 69 transitions. Complement of second has 11 states. [2018-12-08 13:28:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-08 13:28:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 13:28:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-08 13:28:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 12 letters. [2018-12-08 13:28:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:28:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 21 letters. Loop has 12 letters. [2018-12-08 13:28:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:28:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 24 letters. [2018-12-08 13:28:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 13:28:04,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 69 transitions. [2018-12-08 13:28:04,444 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 13:28:04,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2018-12-08 13:28:04,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 13:28:04,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 13:28:04,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 13:28:04,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 13:28:04,444 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:28:04,444 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:28:04,444 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 13:28:04,445 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 13:28:04,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 13:28:04,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 13:28:04,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 13:28:04,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 01:28:04 BoogieIcfgContainer [2018-12-08 13:28:04,450 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 13:28:04,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 13:28:04,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 13:28:04,450 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 13:28:04,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:27:34" (3/4) ... [2018-12-08 13:28:04,453 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 13:28:04,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 13:28:04,453 INFO L168 Benchmark]: Toolchain (without parser) took 30817.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.9 MB). Free memory was 950.6 MB in the beginning and 908.2 MB in the end (delta: 42.4 MB). Peak memory consumption was 386.4 MB. Max. memory is 11.5 GB. [2018-12-08 13:28:04,454 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:28:04,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 13:28:04,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 13:28:04,454 INFO L168 Benchmark]: Boogie Preprocessor took 13.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:28:04,454 INFO L168 Benchmark]: RCFGBuilder took 155.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-08 13:28:04,454 INFO L168 Benchmark]: BuchiAutomizer took 30348.58 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.1 GB in the beginning and 908.2 MB in the end (delta: 163.8 MB). Peak memory consumption was 405.5 MB. Max. memory is 11.5 GB. [2018-12-08 13:28:04,455 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.4 GB. Free memory is still 908.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:28:04,456 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 155.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30348.58 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.1 GB in the beginning and 908.2 MB in the end (delta: 163.8 MB). Peak memory consumption was 405.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.4 GB. Free memory is still 908.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 0.1s. Büchi inclusion checks took 21.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/6 HoareTripleCheckerStatistics: 67 SDtfs, 147 SDslu, 43 SDs, 0 SdLazy, 184 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital1222 mio100 ax103 hnf99 lsp80 ukn49 mio100 lsp34 div100 bol103 ite100 ukn100 eq178 hnf88 smp97 dnf124 smp86 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...