./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/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_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/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-aa41828 [2018-11-22 21:19:45,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:19:45,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:19:45,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:19:45,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:19:45,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:19:45,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:19:45,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:19:45,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:19:45,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:19:45,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:19:45,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:19:45,912 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:19:45,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:19:45,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:19:45,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:19:45,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:19:45,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:19:45,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:19:45,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:19:45,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:19:45,920 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:19:45,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:19:45,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:19:45,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:19:45,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:19:45,923 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:19:45,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:19:45,924 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:19:45,925 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:19:45,925 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:19:45,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:19:45,926 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:19:45,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:19:45,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:19:45,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:19:45,927 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 21:19:45,938 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:19:45,938 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:19:45,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:19:45,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:19:45,940 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:19:45,940 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:19:45,940 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:19:45,940 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:19:45,940 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:19:45,940 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:19:45,940 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:19:45,940 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:19:45,941 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:19:45,941 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:19:45,941 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:19:45,941 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:19:45,941 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:19:45,941 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:19:45,941 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:19:45,942 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:19:45,942 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:19:45,942 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:19:45,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:19:45,942 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:19:45,942 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:19:45,942 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:19:45,943 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:19:45,943 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:19:45,943 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:19:45,943 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_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/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-11-22 21:19:45,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:19:45,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:19:45,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:19:45,979 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:19:45,980 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:19:45,980 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-22 21:19:46,024 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/data/f913fae3d/7269513718a94c61bf01cf6d2fb1ed62/FLAGcbf5a1d1d [2018-11-22 21:19:46,389 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:19:46,390 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-22 21:19:46,400 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/data/f913fae3d/7269513718a94c61bf01cf6d2fb1ed62/FLAGcbf5a1d1d [2018-11-22 21:19:46,783 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/data/f913fae3d/7269513718a94c61bf01cf6d2fb1ed62 [2018-11-22 21:19:46,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:19:46,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:19:46,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:19:46,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:19:46,789 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:19:46,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:19:46" (1/1) ... [2018-11-22 21:19:46,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a4561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:46, skipping insertion in model container [2018-11-22 21:19:46,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:19:46" (1/1) ... [2018-11-22 21:19:46,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:19:46,823 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:19:47,004 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:19:47,010 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:19:47,038 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:19:47,103 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:19:47,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47 WrapperNode [2018-11-22 21:19:47,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:19:47,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:19:47,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:19:47,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:19:47,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:19:47,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:19:47,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:19:47,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:19:47,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... [2018-11-22 21:19:47,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:19:47,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:19:47,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:19:47,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:19:47,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15f5a7b6-4b11-4fd4-afb9-a2ebd869a386/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:19:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:19:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:19:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:19:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:19:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:19:47,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:19:47,333 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:19:47,334 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 21:19:47,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:19:47 BoogieIcfgContainer [2018-11-22 21:19:47,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:19:47,335 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:19:47,335 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:19:47,337 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:19:47,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:19:47,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:19:46" (1/3) ... [2018-11-22 21:19:47,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@449ea5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:19:47, skipping insertion in model container [2018-11-22 21:19:47,338 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:19:47,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:19:47" (2/3) ... [2018-11-22 21:19:47,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@449ea5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:19:47, skipping insertion in model container [2018-11-22 21:19:47,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:19:47,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:19:47" (3/3) ... [2018-11-22 21:19:47,340 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-22 21:19:47,376 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:19:47,376 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:19:47,377 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:19:47,377 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:19:47,377 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:19:47,377 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:19:47,377 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:19:47,377 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:19:47,377 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:19:47,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-22 21:19:47,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 21:19:47,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:19:47,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:19:47,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:19:47,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:19:47,405 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:19:47,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-22 21:19:47,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 21:19:47,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:19:47,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:19:47,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:19:47,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:19:47,411 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-11-22 21:19:47,411 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:47,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 21:19:47,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:47,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:47,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:47,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-11-22 21:19:47,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:47,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:47,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:47,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:47,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-11-22 21:19:47,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:47,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:47,755 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-22 21:19:47,905 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:19:47,906 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:19:47,906 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:19:47,906 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:19:47,906 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:19:47,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:19:47,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:19:47,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:19:47,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-22 21:19:47,907 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:19:47,907 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:19:47,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,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-11-22 21:19:47,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,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-11-22 21:19:47,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,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-11-22 21:19:47,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-11-22 21:19:47,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-11-22 21:19:47,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:47,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:48,229 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-11-22 21:19:48,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:48,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:48,510 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:19:48,513 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:19:48,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,522 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 21:19:48,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,523 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 21:19:48,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:48,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:48,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:48,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:48,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:48,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:48,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:48,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:48,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:48,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:48,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:48,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:48,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-11-22 21:19:48,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:48,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:48,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:48,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:48,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:48,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:48,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:48,588 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:19:48,591 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:19:48,591 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:19:48,593 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:19:48,593 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 21:19:48,593 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:19:48,594 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-22 21:19:48,651 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-22 21:19:48,656 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:19:48,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:48,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:48,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:19:48,748 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-22 21:19:48,749 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-11-22 21:19:48,838 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-11-22 21:19:48,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 21:19:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 21:19:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-22 21:19:48,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-22 21:19:48,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:48,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-22 21:19:48,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:48,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-22 21:19:48,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:48,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 71 transitions. [2018-11-22 21:19:48,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-22 21:19:48,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 31 states and 44 transitions. [2018-11-22 21:19:48,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-22 21:19:48,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 21:19:48,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2018-11-22 21:19:48,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:19:48,850 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-22 21:19:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2018-11-22 21:19:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-22 21:19:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 21:19:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-22 21:19:48,869 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-11-22 21:19:48,869 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-11-22 21:19:48,869 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:19:48,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. [2018-11-22 21:19:48,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-22 21:19:48,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:19:48,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:19:48,870 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:19:48,870 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:19:48,870 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-11-22 21:19:48,870 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:48,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-22 21:19:48,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:48,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:48,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:48,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:48,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:48,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2018-11-22 21:19:48,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:48,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:48,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:48,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:48,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:19:48,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:19:48,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:19:48,911 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:19:48,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:19:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:19:48,914 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-22 21:19:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:19:48,952 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-22 21:19:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:19:48,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-22 21:19:48,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 21:19:48,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2018-11-22 21:19:48,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-22 21:19:48,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-22 21:19:48,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-22 21:19:48,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:19:48,955 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-22 21:19:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-22 21:19:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-22 21:19:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 21:19:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-22 21:19:48,956 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-22 21:19:48,957 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-22 21:19:48,957 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:19:48,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-22 21:19:48,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 21:19:48,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:19:48,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:19:48,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:19:48,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:19:48,960 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:48,961 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:48,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-11-22 21:19:48,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:48,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:48,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:48,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:48,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:49,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-11-22 21:19:49,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:49,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:49,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:49,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:49,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:49,019 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2018-11-22 21:19:49,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:49,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:49,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:49,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:19:49,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:49,198 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-22 21:19:49,474 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 100 [2018-11-22 21:19:49,539 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:19:49,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:19:49,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:19:49,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:19:49,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:19:49,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:19:49,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:19:49,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:19:49,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-22 21:19:49,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:19:49,540 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:19:49,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:49,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:50,007 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:19:50,007 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:19:50,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:50,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:50,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:50,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:50,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:50,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,035 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 21:19:50,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,035 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 21:19:50,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:50,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:50,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:50,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:50,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:50,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,059 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:19:50,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,060 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:19:50,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,071 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:19:50,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,072 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:19:50,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,092 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:19:50,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,093 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:19:50,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:50,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:50,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:50,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:50,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:50,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:50,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:50,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:50,118 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:19:50,120 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:19:50,120 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:19:50,121 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:19:50,122 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:19:50,122 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:19:50,122 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-11-22 21:19:50,198 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-22 21:19:50,200 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:19:50,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:50,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:50,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:50,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-22 21:19:50,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:50,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:50,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-22 21:19:50,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:50,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:50,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:50,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-22 21:19:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:50,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:19:50,310 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-22 21:19:50,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-22 21:19:50,363 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-11-22 21:19:50,364 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-11-22 21:19:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:19:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-22 21:19:50,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-22 21:19:50,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:50,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-22 21:19:50,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:50,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-22 21:19:50,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:50,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-22 21:19:50,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 21:19:50,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2018-11-22 21:19:50,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-22 21:19:50,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 21:19:50,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-11-22 21:19:50,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:19:50,367 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-22 21:19:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-11-22 21:19:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-22 21:19:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-22 21:19:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-22 21:19:50,369 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-22 21:19:50,370 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-22 21:19:50,370 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 21:19:50,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-22 21:19:50,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 21:19:50,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:19:50,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:19:50,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-11-22 21:19:50,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:19:50,371 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:50,371 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:50,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:50,371 INFO L82 PathProgramCache]: Analyzing trace with hash -692497895, now seen corresponding path program 2 times [2018-11-22 21:19:50,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:50,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:50,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2018-11-22 21:19:50,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:50,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:50,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:50,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:19:50,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:50,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:50,415 INFO L82 PathProgramCache]: Analyzing trace with hash 502600418, now seen corresponding path program 2 times [2018-11-22 21:19:50,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:50,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:50,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:50,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:19:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:50,569 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-22 21:19:51,167 WARN L180 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 131 [2018-11-22 21:19:51,309 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-22 21:19:51,311 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:19:51,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:19:51,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:19:51,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:19:51,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:19:51,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:19:51,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:19:51,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:19:51,311 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-22 21:19:51,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:19:51,312 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:19:51,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,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-11-22 21:19:51,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-11-22 21:19:51,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-11-22 21:19:51,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-11-22 21:19:51,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,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-11-22 21:19:51,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:51,816 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:19:51,816 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:19:51,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:51,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:51,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:51,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:51,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:51,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:51,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:51,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:51,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:51,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:51,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,828 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 21:19:51,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 21:19:51,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:51,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:51,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:51,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:51,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:51,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:51,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:51,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:51,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:51,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:51,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,856 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:19:51,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,857 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:19:51,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,860 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:19:51,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,861 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:19:51,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:51,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:51,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:51,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:51,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:51,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:51,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:51,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:51,888 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:19:51,890 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:19:51,890 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:19:51,890 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:19:51,891 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:19:51,891 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:19:51,891 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-22 21:19:51,959 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-22 21:19:51,960 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:19:51,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:52,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:52,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-22 21:19:52,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-22 21:19:52,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-22 21:19:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:52,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:19:52,063 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-22 21:19:52,064 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-22 21:19:52,105 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-11-22 21:19:52,106 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-11-22 21:19:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:19:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-22 21:19:52,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-22 21:19:52,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:52,106 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:19:52,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:52,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:52,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-22 21:19:52,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-22 21:19:52,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-22 21:19:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:52,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:19:52,207 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-11-22 21:19:52,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-22 21:19:52,243 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-11-22 21:19:52,244 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-11-22 21:19:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:19:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-22 21:19:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-22 21:19:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:52,244 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:19:52,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:52,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:52,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-22 21:19:52,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:52,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-22 21:19:52,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:52,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-22 21:19:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:52,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:19:52,340 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-11-22 21:19:52,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-22 21:19:52,376 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-11-22 21:19:52,378 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-11-22 21:19:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:19:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-22 21:19:52,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-22 21:19:52,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:52,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-22 21:19:52,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:52,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-22 21:19:52,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:52,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-11-22 21:19:52,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-22 21:19:52,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 44 transitions. [2018-11-22 21:19:52,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-22 21:19:52,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 21:19:52,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2018-11-22 21:19:52,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:19:52,382 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-22 21:19:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2018-11-22 21:19:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 14. [2018-11-22 21:19:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-22 21:19:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-22 21:19:52,384 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-22 21:19:52,384 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-22 21:19:52,384 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 21:19:52,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-22 21:19:52,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-22 21:19:52,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:19:52,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:19:52,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 21:19:52,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:19:52,385 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-11-22 21:19:52,385 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:52,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:52,387 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-22 21:19:52,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:52,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:52,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:52,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:19:52,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:52,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577164, now seen corresponding path program 1 times [2018-11-22 21:19:52,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:52,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:52,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:52,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:19:52,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:52,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 3 times [2018-11-22 21:19:52,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:52,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:52,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:52,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:19:52,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:52,560 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-22 21:19:52,648 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:19:52,648 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:19:52,648 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:19:52,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:19:52,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:19:52,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:19:52,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:19:52,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:19:52,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-22 21:19:52,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:19:52,649 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:19:52,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-11-22 21:19:52,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,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-11-22 21:19:52,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,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-11-22 21:19:52,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:52,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:53,055 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:19:53,055 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:19:53,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:53,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:53,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:53,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:53,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:53,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:53,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:53,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:53,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:53,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:53,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:53,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:53,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:53,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:53,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:53,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:53,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:53,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:53,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:53,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:53,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:53,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:53,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:53,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:53,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:53,103 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:19:53,103 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:19:53,104 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:19:53,104 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:19:53,104 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 21:19:53,104 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:19:53,104 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-11-22 21:19:53,184 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-22 21:19:53,186 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:19:53,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:53,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:53,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:19:53,235 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-22 21:19:53,235 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-22 21:19:53,266 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-11-22 21:19:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 21:19:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:19:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-11-22 21:19:53,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-22 21:19:53,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:53,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-22 21:19:53,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:53,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-22 21:19:53,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:19:53,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2018-11-22 21:19:53,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-22 21:19:53,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 30 transitions. [2018-11-22 21:19:53,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 21:19:53,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 21:19:53,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-11-22 21:19:53,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:19:53,269 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-22 21:19:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-11-22 21:19:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-11-22 21:19:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 21:19:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-22 21:19:53,270 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-22 21:19:53,270 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-22 21:19:53,270 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 21:19:53,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-22 21:19:53,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-22 21:19:53,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:19:53,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:19:53,270 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:19:53,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 21:19:53,271 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:53,271 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:19:53,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2018-11-22 21:19:53,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:53,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:53,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:53,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:19:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:53,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2018-11-22 21:19:53,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:53,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:53,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:19:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:53,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 3 times [2018-11-22 21:19:53,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:19:53,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:19:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:53,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:19:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:19:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:19:53,483 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-11-22 21:19:53,799 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2018-11-22 21:19:54,166 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2018-11-22 21:19:54,168 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:19:54,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:19:54,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:19:54,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:19:54,169 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:19:54,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:19:54,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:19:54,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:19:54,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-22 21:19:54,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:19:54,169 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:19:54,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,522 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-11-22 21:19:54,732 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-11-22 21:19:54,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:54,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:19:55,022 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:19:55,022 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:19:55,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:55,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:55,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:55,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:55,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:55,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:55,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:55,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:55,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:55,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:55,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:55,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:55,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:55,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:55,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:55,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:55,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:55,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:55,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:55,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:55,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:55,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:19:55,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:19:55,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:19:55,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:55,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:55,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:55,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,046 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:19:55,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,047 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:19:55,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,050 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:19:55,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,051 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:19:55,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:19:55,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:19:55,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:19:55,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:19:55,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:19:55,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:19:55,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:19:55,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:19:55,057 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:19:55,058 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:19:55,059 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:19:55,059 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:19:55,059 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:19:55,059 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:19:55,060 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-11-22 21:19:55,135 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-22 21:19:55,136 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:19:55,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:19:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:55,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-22 21:19:55,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-22 21:19:55,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-22 21:19:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:19:55,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:19:55,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-22 21:19:55,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:19:55,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,281 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-11-22 21:19:55,283 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-11-22 21:19:55,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,294 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-11-22 21:19:55,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:19:55,299 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,322 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-11-22 21:19:55,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:19:55,350 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,383 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-11-22 21:19:55,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-22 21:19:55,387 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,401 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-11-22 21:19:55,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:19:55,405 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,409 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,414 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,420 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-11-22 21:19:55,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,423 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-11-22 21:19:55,424 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,436 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-11-22 21:19:55,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,439 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-11-22 21:19:55,439 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,443 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,448 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,463 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-11-22 21:19:55,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,469 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-11-22 21:19:55,469 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,532 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 52 treesize of output 61 [2018-11-22 21:19:55,532 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,582 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-11-22 21:19:55,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,586 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:19:55,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,593 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-11-22 21:19:55,594 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,607 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,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, 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-11-22 21:19:55,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,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, 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-11-22 21:19:55,641 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,647 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,676 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-11-22 21:19:55,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:55,680 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-11-22 21:19:55,681 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,710 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-11-22 21:19:55,710 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,725 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:19:55,735 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:55,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:19:55,773 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-11-22 21:19:56,310 WARN L180 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-22 21:19:56,313 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-11-22 21:19:56,313 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:56,315 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-11-22 21:19:56,316 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:56,318 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-11-22 21:19:56,318 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:56,663 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-11-22 21:19:56,663 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:56,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:56,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:56,997 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-11-22 21:19:57,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,004 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-11-22 21:19:57,004 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,021 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-11-22 21:19:57,033 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-11-22 21:19:57,035 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:19:57,047 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,061 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,078 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-11-22 21:19:57,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,085 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 91 treesize of output 90 [2018-11-22 21:19:57,085 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,140 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-11-22 21:19:57,141 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,187 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-11-22 21:19:57,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:19:57,190 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,199 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-22 21:19:57,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:19:57,240 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,247 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,263 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:19:57,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,296 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-11-22 21:19:57,305 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-22 21:19:57,306 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:57,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:57,870 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 64 treesize of output 78 [2018-11-22 21:19:57,871 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:58,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:58,460 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-11-22 21:19:58,460 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-22 21:19:59,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,040 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-11-22 21:19:59,041 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-11-22 21:19:59,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2018-11-22 21:19:59,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,685 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:19:59,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:19:59,700 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2018-11-22 21:19:59,700 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-11-22 21:19:59,737 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:00,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,144 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-11-22 21:20:00,146 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 111 treesize of output 96 [2018-11-22 21:20:00,146 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:00,182 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:00,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,457 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-11-22 21:20:00,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,459 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-11-22 21:20:00,460 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:00,466 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:00,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,640 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 3 case distinctions, treesize of input 63 treesize of output 93 [2018-11-22 21:20:00,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,643 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 76 treesize of output 65 [2018-11-22 21:20:00,643 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:00,672 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:00,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,807 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-11-22 21:20:00,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,809 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-11-22 21:20:00,810 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:00,819 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:00,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,904 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 67 treesize of output 109 [2018-11-22 21:20:00,908 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 114 treesize of output 99 [2018-11-22 21:20:00,908 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:00,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,952 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2018-11-22 21:20:00,952 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:00,971 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:00,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:00,985 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 3 case distinctions, treesize of input 59 treesize of output 90 [2018-11-22 21:20:00,988 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 91 treesize of output 83 [2018-11-22 21:20:00,988 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:01,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:01,028 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 51 treesize of output 56 [2018-11-22 21:20:01,028 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:01,046 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:01,202 INFO L267 ElimStorePlain]: Start of recursive call 44: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-22 21:20:01,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:01,432 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-11-22 21:20:01,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:01,440 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 68 treesize of output 73 [2018-11-22 21:20:01,440 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:02,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:02,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, 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-11-22 21:20:02,361 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:02,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:02,938 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-11-22 21:20:02,939 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:03,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:03,906 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-11-22 21:20:03,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:03,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, 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-11-22 21:20:03,910 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:03,918 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,232 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-11-22 21:20:04,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,234 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-11-22 21:20:04,235 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,242 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,384 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 3 case distinctions, treesize of input 63 treesize of output 93 [2018-11-22 21:20:04,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,388 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 76 treesize of output 65 [2018-11-22 21:20:04,388 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,418 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:04,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,606 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 1 case distinctions, treesize of input 63 treesize of output 87 [2018-11-22 21:20:04,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,610 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:20:04,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,620 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-11-22 21:20:04,620 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,633 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,765 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-11-22 21:20:04,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-22 21:20:04,771 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,784 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,811 INFO L267 ElimStorePlain]: Start of recursive call 65: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,821 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-11-22 21:20:04,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,826 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-11-22 21:20:04,827 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-22 21:20:04,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,854 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-11-22 21:20:04,855 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,863 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,873 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,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, 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-11-22 21:20:04,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,905 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-11-22 21:20:04,906 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:04,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:04,965 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-11-22 21:20:04,965 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,015 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-11-22 21:20:05,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:05,018 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,028 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,062 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-11-22 21:20:05,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:05,064 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,070 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,099 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-11-22 21:20:05,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:05,102 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,112 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,124 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,173 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:05,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:05,207 INFO L202 ElimStorePlain]: Needed 91 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-22 21:20:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:20:05,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-22 21:20:05,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-22 21:20:05,251 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-11-22 21:20:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 21:20:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 21:20:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-22 21:20:05,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-22 21:20:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:20:05,254 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:20:05,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:20:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:20:05,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:20:05,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-22 21:20:05,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-22 21:20:05,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-22 21:20:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:20:05,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:20:05,379 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-11-22 21:20:05,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:20:05,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,445 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-11-22 21:20:05,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-22 21:20:05,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,458 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-11-22 21:20:05,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:05,461 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,469 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,478 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-11-22 21:20:05,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,481 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-11-22 21:20:05,481 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,491 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-11-22 21:20:05,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,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, 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-11-22 21:20:05,494 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,498 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,503 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,518 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-11-22 21:20:05,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,523 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-11-22 21:20:05,523 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,574 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 52 treesize of output 61 [2018-11-22 21:20:05,574 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,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, 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-11-22 21:20:05,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,615 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-11-22 21:20:05,615 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,621 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,653 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-11-22 21:20:05,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:05,655 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-11-22 21:20:05,656 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,661 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,674 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:05,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:05,716 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-11-22 21:20:06,316 WARN L180 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-22 21:20:06,318 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-11-22 21:20:06,318 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:06,320 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-11-22 21:20:06,321 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:06,323 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-11-22 21:20:06,323 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:06,714 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-11-22 21:20:06,714 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:07,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:07,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:07,148 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-11-22 21:20:07,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:07,170 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 78 treesize of output 108 [2018-11-22 21:20:07,171 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-22 21:20:08,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:08,073 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 64 treesize of output 78 [2018-11-22 21:20:08,074 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:08,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:08,768 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-11-22 21:20:08,768 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:09,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:09,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:09,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:09,818 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-11-22 21:20:09,819 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:10,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,316 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 3 case distinctions, treesize of input 63 treesize of output 93 [2018-11-22 21:20:10,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,319 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 76 treesize of output 65 [2018-11-22 21:20:10,319 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:10,348 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:10,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2018-11-22 21:20:10,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,886 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:20:10,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:10,903 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2018-11-22 21:20:10,904 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-22 21:20:10,945 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:11,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,169 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-11-22 21:20:11,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,172 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-11-22 21:20:11,173 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:11,181 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:11,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,374 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-11-22 21:20:11,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,378 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-11-22 21:20:11,378 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:11,391 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:11,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,567 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 67 treesize of output 109 [2018-11-22 21:20:11,570 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 114 treesize of output 99 [2018-11-22 21:20:11,571 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:11,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,623 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2018-11-22 21:20:11,624 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:11,644 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:11,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,658 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 3 case distinctions, treesize of input 59 treesize of output 90 [2018-11-22 21:20:11,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,676 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 65 treesize of output 91 [2018-11-22 21:20:11,678 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:20:11,775 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 56 treesize of output 55 [2018-11-22 21:20:11,775 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:11,823 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-22 21:20:11,915 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-22 21:20:11,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,930 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-11-22 21:20:11,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,935 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-11-22 21:20:11,935 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:11,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:11,990 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-11-22 21:20:11,990 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,037 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-11-22 21:20:12,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:12,040 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,049 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,086 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-11-22 21:20:12,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:12,090 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,099 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,122 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-11-22 21:20:12,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:12,124 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,133 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,148 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:12,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,153 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-11-22 21:20:12,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,158 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-11-22 21:20:12,158 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,174 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-11-22 21:20:12,185 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-11-22 21:20:12,186 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:20:12,203 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,210 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,488 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-11-22 21:20:12,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,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, 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-11-22 21:20:12,491 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,502 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-11-22 21:20:12,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,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 35 treesize of output 24 [2018-11-22 21:20:12,505 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,509 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,514 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,529 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-11-22 21:20:12,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,532 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-11-22 21:20:12,532 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,579 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-11-22 21:20:12,579 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,623 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-11-22 21:20:12,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:12,626 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,635 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,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 51 treesize of output 56 [2018-11-22 21:20:12,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,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-11-22 21:20:12,670 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,677 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,700 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-11-22 21:20:12,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:12,702 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,708 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,718 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:12,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,746 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-11-22 21:20:12,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:12,753 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-11-22 21:20:12,753 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:13,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:13,451 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-11-22 21:20:13,451 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:14,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:14,571 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-11-22 21:20:14,571 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:15,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,546 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-11-22 21:20:15,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,548 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-11-22 21:20:15,548 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:15,558 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:15,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,782 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-11-22 21:20:15,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,784 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-11-22 21:20:15,784 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:15,791 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:15,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:15,960 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-11-22 21:20:15,963 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-11-22 21:20:15,963 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:15,998 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:16,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,262 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 51 treesize of output 56 [2018-11-22 21:20:16,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,264 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-11-22 21:20:16,264 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,271 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,317 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-11-22 21:20:16,319 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 67 treesize of output 59 [2018-11-22 21:20:16,320 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-22 21:20:16,346 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,359 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:16,376 INFO L267 ElimStorePlain]: Start of recursive call 69: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,406 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:16,412 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-11-22 21:20:16,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:20:16,440 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,453 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-11-22 21:20:16,455 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-11-22 21:20:16,456 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,466 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-11-22 21:20:16,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:16,469 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,473 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,476 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,481 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:16,516 INFO L202 ElimStorePlain]: Needed 89 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-22 21:20:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:20:16,529 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-22 21:20:16,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-22 21:20:16,566 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-11-22 21:20:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-22 21:20:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 21:20:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-22 21:20:16,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-22 21:20:16,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:20:16,566 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:20:16,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:20:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:20:16,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:20:16,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-22 21:20:16,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-22 21:20:16,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-22 21:20:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:20:16,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:20:16,689 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-11-22 21:20:16,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:20:16,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,731 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-11-22 21:20:16,733 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-11-22 21:20:16,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,750 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-11-22 21:20:16,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:16,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,758 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,778 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-11-22 21:20:16,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:20:16,807 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,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, 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-11-22 21:20:16,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,840 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-11-22 21:20:16,841 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,851 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-11-22 21:20:16,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,853 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-11-22 21:20:16,853 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,857 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,862 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,869 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-11-22 21:20:16,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-22 21:20:16,872 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,883 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-11-22 21:20:16,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:16,886 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,890 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,894 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,910 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-11-22 21:20:16,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,915 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-11-22 21:20:16,915 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:16,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:16,969 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 52 treesize of output 61 [2018-11-22 21:20:16,969 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:17,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,011 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-11-22 21:20:17,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,013 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-11-22 21:20:17,014 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:17,020 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:17,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,060 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-11-22 21:20:17,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,064 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:20:17,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,079 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-11-22 21:20:17,079 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:17,094 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:17,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,124 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-11-22 21:20:17,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:17,127 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-11-22 21:20:17,128 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:17,135 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:17,147 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:17,167 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:17,193 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-11-22 21:20:17,749 WARN L180 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-22 21:20:17,752 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 75 treesize of output 78 [2018-11-22 21:20:17,752 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:18,109 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 80 treesize of output 79 [2018-11-22 21:20:18,109 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:18,111 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 80 treesize of output 79 [2018-11-22 21:20:18,111 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:18,112 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 78 treesize of output 77 [2018-11-22 21:20:18,113 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:18,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:18,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:18,495 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-11-22 21:20:18,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:18,503 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-11-22 21:20:18,504 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:19,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:19,346 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 64 treesize of output 78 [2018-11-22 21:20:19,347 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:19,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:19,946 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-11-22 21:20:19,946 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-22 21:20:21,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,155 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-11-22 21:20:21,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,163 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-11-22 21:20:21,164 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:20:21,182 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:20:21,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,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, 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-11-22 21:20:21,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,200 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-11-22 21:20:21,201 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:20:21,234 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:20:21,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,736 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-11-22 21:20:21,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:21,738 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-11-22 21:20:21,739 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:21,745 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:22,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,432 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 21:20:22,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,434 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 70 treesize of output 100 [2018-11-22 21:20:22,434 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:22,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,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, 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-11-22 21:20:22,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:22,961 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-11-22 21:20:22,962 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:22,971 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,175 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-11-22 21:20:23,178 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-11-22 21:20:23,178 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,224 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:23,404 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-11-22 21:20:23,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,409 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-11-22 21:20:23,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,421 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-11-22 21:20:23,421 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,441 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-11-22 21:20:23,453 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-11-22 21:20:23,454 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-22 21:20:23,469 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,478 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,495 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-11-22 21:20:23,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,501 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 91 treesize of output 90 [2018-11-22 21:20:23,501 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,561 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-11-22 21:20:23,562 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,619 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-11-22 21:20:23,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:23,622 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,636 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,674 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-11-22 21:20:23,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:23,678 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,685 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,725 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-11-22 21:20:23,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:23,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:23,729 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,741 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:23,763 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:20:24,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:24,271 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-11-22 21:20:24,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:24,278 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-11-22 21:20:24,278 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:25,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:25,035 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-11-22 21:20:25,036 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:25,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:25,583 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-11-22 21:20:25,584 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:26,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:26,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:26,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:26,611 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-11-22 21:20:26,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:26,613 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-11-22 21:20:26,614 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:26,624 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:26,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:26,920 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-11-22 21:20:26,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:26,922 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-11-22 21:20:26,923 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:26,929 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,068 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-11-22 21:20:27,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,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-11-22 21:20:27,072 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,078 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,348 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-11-22 21:20:27,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,351 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-11-22 21:20:27,351 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,357 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,375 INFO L267 ElimStorePlain]: Start of recursive call 60: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,389 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-11-22 21:20:27,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,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 74 treesize of output 69 [2018-11-22 21:20:27,394 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,442 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 63 treesize of output 66 [2018-11-22 21:20:27,442 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,485 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-11-22 21:20:27,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:27,488 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,497 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,530 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-11-22 21:20:27,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:27,533 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,538 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,567 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-11-22 21:20:27,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:27,570 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,575 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,586 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,591 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-11-22 21:20:27,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,593 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-11-22 21:20:27,593 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,605 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-11-22 21:20:27,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:27,607 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-11-22 21:20:27,607 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,612 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,617 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:27,653 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:27,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-11-22 21:20:27,689 INFO L202 ElimStorePlain]: Needed 84 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-22 21:20:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:20:27,701 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-22 21:20:27,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-22 21:20:27,733 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-11-22 21:20:27,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 21:20:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 21:20:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-22 21:20:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-22 21:20:27,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:20:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-22 21:20:27,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:20:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-22 21:20:27,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:20:27,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2018-11-22 21:20:27,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-22 21:20:27,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 25 states and 29 transitions. [2018-11-22 21:20:27,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-22 21:20:27,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-22 21:20:27,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-11-22 21:20:27,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:20:27,736 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-22 21:20:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-11-22 21:20:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-11-22 21:20:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-22 21:20:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-22 21:20:27,738 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-22 21:20:27,738 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-22 21:20:27,738 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 21:20:27,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-22 21:20:27,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-22 21:20:27,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:20:27,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:20:27,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:20:27,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2018-11-22 21:20:27,739 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:20:27,739 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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~short9;havoc main_#t~mem5;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6; 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-11-22 21:20:27,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:20:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 3 times [2018-11-22 21:20:27,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:20:27,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:20:27,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:20:27,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:20:27,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:20:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:20:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:20:27,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:20:27,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1005496147, now seen corresponding path program 1 times [2018-11-22 21:20:27,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:20:27,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:20:27,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:20:27,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:20:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:20:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:20:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:20:27,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:20:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash -588138969, now seen corresponding path program 4 times [2018-11-22 21:20:27,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:20:27,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:20:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:20:27,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:20:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:20:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:20:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:20:28,152 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2018-11-22 21:20:28,483 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2018-11-22 21:20:28,683 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2018-11-22 21:20:28,994 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2018-11-22 21:20:28,997 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:20:28,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:20:28,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:20:28,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:20:28,997 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:20:28,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:20:28,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:20:28,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:20:28,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-22 21:20:28,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:20:28,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:20:29,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,301 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2018-11-22 21:20:29,511 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-11-22 21:20:29,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:20:29,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:20:29,827 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:20:29,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:20:29,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:20:29,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:20:29,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:20:29,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:20:29,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:20:29,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:20:29,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:20:29,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:20:29,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:20:29,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:20:29,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:20:29,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:20:29,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:20:29,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:20:29,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:20:29,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:20:29,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:20:29,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:20:29,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:20:29,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:20:29,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:20:29,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:20:29,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:20:29,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:20:29,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:20:29,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:20:29,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:20:29,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:20:29,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:20:29,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:20:29,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:20:29,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:20:29,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:20:29,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:20:29,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:20:29,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:20:29,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:20:29,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:20:29,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:20:29,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:20:29,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:20:29,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:20:29,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:20:29,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:20:29,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:20:29,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:20:29,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:20:29,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:20:29,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:20:29,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:20:29,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:20:29,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:20:29,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:20:29,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:20:29,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:20:29,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:20:29,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:20:29,840 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:20:29,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:20:29,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:20:29,841 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:20:29,841 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 21:20:29,841 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:20:29,841 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-22 21:20:29,921 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-22 21:20:29,923 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:20:29,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:20:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:20:29,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:20:29,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:29,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-22 21:20:29,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:29,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:29,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-22 21:20:29,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:29,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:29,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:29,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-22 21:20:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:20:29,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:20:30,051 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-11-22 21:20:30,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:20:30,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:30,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:30,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, 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-11-22 21:20:30,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:30,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-22 21:20:30,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:30,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:30,119 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-11-22 21:20:30,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:30,129 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-11-22 21:20:30,130 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-22 21:20:30,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:30,169 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-11-22 21:20:30,169 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:30,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:30,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:30,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:30,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-22 21:20:30,241 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:154, output treesize:93 [2018-11-22 21:20:30,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:30,267 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-11-22 21:20:30,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:20:30,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-22 21:20:30,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:30,277 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-11-22 21:20:30,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 21:20:30,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:20:30,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:30,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:30,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:20:30,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2018-11-22 21:20:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:20:30,290 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-22 21:20:30,291 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-22 21:20:30,359 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-11-22 21:20:30,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-22 21:20:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 21:20:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-22 21:20:30,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-22 21:20:30,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:20:30,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 21 letters. Loop has 12 letters. [2018-11-22 21:20:30,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:20:30,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 24 letters. [2018-11-22 21:20:30,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:20:30,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 69 transitions. [2018-11-22 21:20:30,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:20:30,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2018-11-22 21:20:30,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 21:20:30,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 21:20:30,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 21:20:30,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:20:30,362 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:20:30,362 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:20:30,362 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:20:30,362 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 21:20:30,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:20:30,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:20:30,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 21:20:30,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 09:20:30 BoogieIcfgContainer [2018-11-22 21:20:30,367 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 21:20:30,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:20:30,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:20:30,368 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:20:30,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:19:47" (3/4) ... [2018-11-22 21:20:30,371 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:20:30,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:20:30,372 INFO L168 Benchmark]: Toolchain (without parser) took 43585.91 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 575.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 397.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:20:30,372 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:20:30,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:20:30,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:20:30,373 INFO L168 Benchmark]: Boogie Preprocessor took 15.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:20:30,373 INFO L168 Benchmark]: RCFGBuilder took 186.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:20:30,373 INFO L168 Benchmark]: BuchiAutomizer took 43032.49 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 439.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.0 MB). Peak memory consumption was 413.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:20:30,374 INFO L168 Benchmark]: Witness Printer took 3.74 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:20:30,375 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 186.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 43032.49 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 439.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.0 MB). Peak memory consumption was 413.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.74 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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 42.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 8.9s. Construction of modules took 0.1s. Büchi inclusion checks took 33.7s. 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: inital1212 mio100 ax103 hnf99 lsp80 ukn49 mio100 lsp34 div100 bol104 ite100 ukn100 eq179 hnf88 smp97 dnf116 smp88 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...