./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/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 2618f63f0acd986074ff563fe806d4dc698d3d84 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:47:59,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:47:59,518 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:47:59,525 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:47:59,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:47:59,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:47:59,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:47:59,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:47:59,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:47:59,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:47:59,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:47:59,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:47:59,529 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:47:59,530 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:47:59,530 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:47:59,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:47:59,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:47:59,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:47:59,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:47:59,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:47:59,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:47:59,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:47:59,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:47:59,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:47:59,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:47:59,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:47:59,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:47:59,537 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:47:59,537 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:47:59,538 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:47:59,538 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:47:59,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:47:59,539 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:47:59,539 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:47:59,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:47:59,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:47:59,540 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 10:47:59,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:47:59,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:47:59,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:47:59,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:47:59,548 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:47:59,548 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 10:47:59,548 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 10:47:59,548 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 10:47:59,548 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 10:47:59,548 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 10:47:59,548 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 10:47:59,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:47:59,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 10:47:59,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:47:59,550 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:47:59,550 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 10:47:59,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:47:59,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:47:59,550 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 10:47:59,551 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 10:47:59,551 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_559ebc65-768d-4f6f-8ed4-173ec30b81a7/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 -> 2618f63f0acd986074ff563fe806d4dc698d3d84 [2018-12-08 10:47:59,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:47:59,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:47:59,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:47:59,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:47:59,580 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:47:59,580 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-12-08 10:47:59,618 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/data/f768626ef/2c40d53cbc7d4405b1c9926877ae6078/FLAG8b1c89e94 [2018-12-08 10:48:00,122 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:48:00,122 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-12-08 10:48:00,128 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/data/f768626ef/2c40d53cbc7d4405b1c9926877ae6078/FLAG8b1c89e94 [2018-12-08 10:48:00,601 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/data/f768626ef/2c40d53cbc7d4405b1c9926877ae6078 [2018-12-08 10:48:00,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:48:00,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:48:00,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:48:00,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:48:00,607 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:48:00,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac4e85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00, skipping insertion in model container [2018-12-08 10:48:00,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:48:00,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:48:00,776 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:48:00,783 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:48:00,838 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:48:00,857 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:48:00,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00 WrapperNode [2018-12-08 10:48:00,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:48:00,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:48:00,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:48:00,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:48:00,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:48:00,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:48:00,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:48:00,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:48:00,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... [2018-12-08 10:48:00,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:48:00,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:48:00,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:48:00,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:48:00,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:48:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:48:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 10:48:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:48:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:48:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:48:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:48:01,068 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:48:01,068 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 10:48:01,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:48:01 BoogieIcfgContainer [2018-12-08 10:48:01,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:48:01,069 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 10:48:01,069 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 10:48:01,071 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 10:48:01,072 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:48:01,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 10:48:00" (1/3) ... [2018-12-08 10:48:01,072 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d872fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:48:01, skipping insertion in model container [2018-12-08 10:48:01,072 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:48:01,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:48:00" (2/3) ... [2018-12-08 10:48:01,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d872fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:48:01, skipping insertion in model container [2018-12-08 10:48:01,073 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 10:48:01,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:48:01" (3/3) ... [2018-12-08 10:48:01,074 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-12-08 10:48:01,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:48:01,108 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 10:48:01,108 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 10:48:01,108 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 10:48:01,108 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:48:01,108 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:48:01,108 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 10:48:01,108 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:48:01,108 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 10:48:01,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-12-08 10:48:01,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:48:01,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:48:01,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:48:01,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 10:48:01,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:48:01,134 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 10:48:01,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-12-08 10:48:01,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:48:01,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:48:01,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:48:01,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 10:48:01,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:48:01,140 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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 4#L560-2true [2018-12-08 10:48:01,141 INFO L796 eck$LassoCheckResult]: Loop: 4#L560-2true call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 6#L558-1true assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 10#L560true assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 4#L560-2true [2018-12-08 10:48:01,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:01,144 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 10:48:01,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:01,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:01,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:48:01,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:01,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2018-12-08 10:48:01,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:01,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:01,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:48:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:01,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:01,279 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-08 10:48:01,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:01,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:01,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:01,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:48:01,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:02,486 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 171 DAG size of output: 147 [2018-12-08 10:48:02,972 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-12-08 10:48:02,981 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:48:02,982 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:48:02,982 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:48:02,982 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:48:02,982 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:48:02,982 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:48:02,983 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:48:02,983 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:48:02,983 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-08 10:48:02,983 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:48:02,983 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:48:03,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-12-08 10:48:03,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-12-08 10:48:03,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:03,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:03,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:03,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:03,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,115 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 119 [2018-12-08 10:48:04,273 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-08 10:48:04,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:04,487 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-12-08 10:48:04,805 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:48:04,809 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:48:04,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:04,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:04,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:04,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:04,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:04,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:04,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:04,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:04,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:04,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,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-12-08 10:48:04,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,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-12-08 10:48:04,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,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-12-08 10:48:04,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,844 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:04,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,846 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:04,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:04,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:04,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:04,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,869 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:04,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,870 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:04,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,877 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:04,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,878 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:04,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:04,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:04,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:04,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,893 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:04,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,894 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:04,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:04,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:04,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:04,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:04,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,927 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:04,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,928 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:04,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:04,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:04,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:04,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:04,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:04,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:04,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:04,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:04,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:04,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:04,934 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:48:04,936 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 10:48:04,936 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 10:48:04,938 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:48:04,938 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 10:48:04,938 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:48:04,938 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 1 Supporting invariants [] [2018-12-08 10:48:05,367 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2018-12-08 10:48:05,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:48:05,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:48:05,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:48:05,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:48:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:48:05,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:48:05,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:05,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:05,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:05,484 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 48 treesize of output 74 [2018-12-08 10:48:05,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:05,490 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 65 treesize of output 58 [2018-12-08 10:48:05,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:05,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:05,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 60 [2018-12-08 10:48:05,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 10:48:05,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:48:05,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:48:05,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2018-12-08 10:48:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:48:05,636 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 10:48:05,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2018-12-08 10:48:05,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 10 states. [2018-12-08 10:48:05,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 10:48:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 10:48:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-08 10:48:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 2 letters. Loop has 3 letters. [2018-12-08 10:48:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:48:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-08 10:48:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:48:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-08 10:48:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:48:05,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-12-08 10:48:05,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:48:05,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 14 transitions. [2018-12-08 10:48:05,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-08 10:48:05,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-08 10:48:05,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-08 10:48:05,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:48:05,720 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 10:48:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-08 10:48:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-08 10:48:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 10:48:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-08 10:48:05,736 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 10:48:05,736 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-08 10:48:05,736 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 10:48:05,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-08 10:48:05,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:48:05,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:48:05,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:48:05,737 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 10:48:05,737 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:48:05,737 INFO L794 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 546#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 547#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 552#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 554#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 548#L560-2 [2018-12-08 10:48:05,737 INFO L796 eck$LassoCheckResult]: Loop: 548#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 549#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 556#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 548#L560-2 [2018-12-08 10:48:05,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-12-08 10:48:05,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:05,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:05,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:48:05,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:05,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:05,789 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2018-12-08 10:48:05,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:05,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:05,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:48:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:05,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:05,796 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-12-08 10:48:05,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:05,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:05,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:05,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:48:05,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:07,400 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 203 DAG size of output: 173 [2018-12-08 10:48:08,178 WARN L180 SmtUtils]: Spent 776.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-08 10:48:08,182 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:48:08,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:48:08,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:48:08,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:48:08,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:48:08,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:48:08,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:48:08,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:48:08,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-08 10:48:08,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:48:08,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:48:08,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:08,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:08,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:08,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:08,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,394 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 129 [2018-12-08 10:48:09,562 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-08 10:48:09,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:09,794 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-12-08 10:48:10,072 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:48:10,072 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:48:10,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-12-08 10:48:10,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:10,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:10,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:10,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,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-12-08 10:48:10,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,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-12-08 10:48:10,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,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-12-08 10:48:10,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:10,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,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-12-08 10:48:10,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:10,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,087 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:10,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,088 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:10,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,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-12-08 10:48:10,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,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-12-08 10:48:10,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:10,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:10,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:10,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-12-08 10:48:10,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:10,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:10,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:10,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:10,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:10,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:10,110 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:48:10,114 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 10:48:10,114 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 10:48:10,115 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:48:10,116 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-08 10:48:10,116 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:48:10,116 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 2*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_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 - 1 >= 0] [2018-12-08 10:48:10,578 INFO L297 tatePredicateManager]: 111 out of 117 supporting invariants were superfluous and have been removed [2018-12-08 10:48:10,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:48:10,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:48:10,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:48:10,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:48:10,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:48:10,622 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 58 treesize of output 54 [2018-12-08 10:48:10,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-08 10:48:10,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 64 [2018-12-08 10:48:10,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-12-08 10:48:10,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2018-12-08 10:48:10,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2018-12-08 10:48:10,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:10,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:10,751 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:10,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:10,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:10,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:10,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:10,814 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:35 [2018-12-08 10:48:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:48:10,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:48:10,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 108 [2018-12-08 10:48:10,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:10,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 64 treesize of output 97 [2018-12-08 10:48:10,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-12-08 10:48:11,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:11,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2018-12-08 10:48:11,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 10:48:11,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:11,584 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 69 treesize of output 72 [2018-12-08 10:48:11,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:11,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:11,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:48:11,811 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:48:12,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:12,019 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 62 treesize of output 65 [2018-12-08 10:48:12,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:12,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:12,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:48:12,173 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-12-08 10:48:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:48:12,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:48:12,368 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:83, output treesize:670 [2018-12-08 10:48:12,728 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-12-08 10:48:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:48:12,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-08 10:48:12,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-12-08 10:48:12,787 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 17 states and 22 transitions. Complement of second has 9 states. [2018-12-08 10:48:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 10:48:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 10:48:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-08 10:48:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-08 10:48:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:48:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-08 10:48:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:48:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-08 10:48:12,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:48:12,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-08 10:48:12,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:48:12,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-12-08 10:48:12,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 10:48:12,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 10:48:12,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-12-08 10:48:12,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:48:12,791 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-08 10:48:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-12-08 10:48:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-08 10:48:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 10:48:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-12-08 10:48:12,792 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-08 10:48:12,792 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-08 10:48:12,792 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 10:48:12,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-12-08 10:48:12,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:48:12,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:48:12,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:48:12,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1] [2018-12-08 10:48:12,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:48:12,793 INFO L794 eck$LassoCheckResult]: Stem: 1109#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1102#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1103#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1115#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1113#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 1112#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1108#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1110#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 1104#L560-2 [2018-12-08 10:48:12,793 INFO L796 eck$LassoCheckResult]: Loop: 1104#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1105#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1114#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 1104#L560-2 [2018-12-08 10:48:12,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash 179493187, now seen corresponding path program 2 times [2018-12-08 10:48:12,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:12,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:12,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:48:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:12,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:12,837 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 3 times [2018-12-08 10:48:12,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:12,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:12,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:48:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:12,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:12,843 INFO L82 PathProgramCache]: Analyzing trace with hash 47257513, now seen corresponding path program 2 times [2018-12-08 10:48:12,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:48:12,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:48:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:12,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:48:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:48:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:48:18,610 WARN L180 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 234 DAG size of output: 202 [2018-12-08 10:48:20,528 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 173 [2018-12-08 10:48:20,532 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:48:20,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:48:20,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:48:20,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:48:20,532 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:48:20,533 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:48:20,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:48:20,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:48:20,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 10:48:20,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:48:20,533 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:48:20,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,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-12-08 10:48:20,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-12-08 10:48:20,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-12-08 10:48:20,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-12-08 10:48:20,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-12-08 10:48:20,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-12-08 10:48:20,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:20,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-12-08 10:48:20,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-12-08 10:48:22,319 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 130 [2018-12-08 10:48:22,491 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-08 10:48:22,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:22,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:22,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:48:22,663 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-12-08 10:48:22,976 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:48:22,976 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:48:22,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:22,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:22,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:22,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:22,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:22,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:22,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:22,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:22,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:22,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:22,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:48:22,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:48:22,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:48:22,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:22,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:22,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:22,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,996 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:22,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,997 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:22,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:22,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:22,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:22,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:22,999 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:22,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:22,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:22,999 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:22,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,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-12-08 10:48:23,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,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-12-08 10:48:23,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,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-12-08 10:48:23,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,030 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:23,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,031 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:23,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,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-12-08 10:48:23,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,035 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:23,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,036 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:23,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,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-12-08 10:48:23,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,043 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:48:23,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,044 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:48:23,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:48:23,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:48:23,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:48:23,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:48:23,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:48:23,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:48:23,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:48:23,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:48:23,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:48:23,057 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 10:48:23,057 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 10:48:23,057 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:48:23,058 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-08 10:48:23,058 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:48:23,058 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~w~0.base) ULTIMATE.start_main_~w~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~w~0.base) ULTIMATE.start_main_~w~0.offset)_3 + 6*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 - 6*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~w~0.base) ULTIMATE.start_main_~w~0.offset)_3 - 3 >= 0] [2018-12-08 10:48:23,547 INFO L297 tatePredicateManager]: 111 out of 117 supporting invariants were superfluous and have been removed [2018-12-08 10:48:23,553 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:48:23,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:48:23,554 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:48:23,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:48:23,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:48:23,686 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 75 treesize of output 68 [2018-12-08 10:48:23,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-12-08 10:48:23,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 72 [2018-12-08 10:48:23,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 82 [2018-12-08 10:48:23,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 95 [2018-12-08 10:48:23,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:23,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 73 [2018-12-08 10:48:23,899 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:23,945 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:23,981 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:24,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:24,099 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:24,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:24,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:24,245 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 143 [2018-12-08 10:48:24,882 WARN L180 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-08 10:48:24,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-12-08 10:48:24,888 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:24,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-12-08 10:48:24,892 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:24,892 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:48:24,892 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:25,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 99 [2018-12-08 10:48:25,042 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:25,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 121 [2018-12-08 10:48:25,167 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:48:25,167 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:27,727 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 71 treesize of output 70 [2018-12-08 10:48:27,727 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:29,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:48:29,363 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-08 10:48:31,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:48:31,230 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-08 10:48:33,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 96 [2018-12-08 10:48:33,251 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 12 treesize of output 11 [2018-12-08 10:48:33,251 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:33,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:33,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 105 [2018-12-08 10:48:33,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:33,291 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:33,313 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:33,321 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:34,708 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:48:34,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 108 [2018-12-08 10:48:34,729 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 12 treesize of output 11 [2018-12-08 10:48:34,730 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:34,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:34,761 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:48:34,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 128 [2018-12-08 10:48:34,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:34,778 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:34,802 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:34,810 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:35,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2018-12-08 10:48:35,731 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 12 treesize of output 11 [2018-12-08 10:48:35,731 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:35,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:35,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 102 [2018-12-08 10:48:35,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:35,768 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:35,786 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:35,792 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:35,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:48:35,806 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 12 treesize of output 11 [2018-12-08 10:48:35,806 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:35,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:35,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:48:35,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:35,838 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:35,850 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:35,857 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:36,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 101 [2018-12-08 10:48:36,387 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 12 treesize of output 11 [2018-12-08 10:48:36,387 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:36,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:36,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 121 [2018-12-08 10:48:36,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:36,443 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:36,466 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:36,472 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:36,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 101 [2018-12-08 10:48:36,873 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 12 treesize of output 11 [2018-12-08 10:48:36,874 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:36,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:36,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 121 [2018-12-08 10:48:36,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:36,924 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:36,948 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:36,955 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 98 [2018-12-08 10:48:37,072 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 12 treesize of output 11 [2018-12-08 10:48:37,072 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:37,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 118 [2018-12-08 10:48:37,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:37,116 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,141 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,147 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:48:37,209 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 12 treesize of output 11 [2018-12-08 10:48:37,209 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:37,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:48:37,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:37,238 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,250 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,257 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,301 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:48:37,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 95 [2018-12-08 10:48:37,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-12-08 10:48:37,419 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 78 [2018-12-08 10:48:37,548 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 4 xjuncts. [2018-12-08 10:48:37,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2018-12-08 10:48:37,699 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 12 treesize of output 11 [2018-12-08 10:48:37,699 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:37,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 102 [2018-12-08 10:48:37,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:37,739 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,758 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,765 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:48:37,872 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 12 treesize of output 11 [2018-12-08 10:48:37,872 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:37,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 101 [2018-12-08 10:48:37,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:37,910 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,931 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,938 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:37,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:48:37,991 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 12 treesize of output 11 [2018-12-08 10:48:37,991 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:48:38,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:38,020 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,034 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,043 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:48:38,059 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 12 treesize of output 11 [2018-12-08 10:48:38,059 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:48:38,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:38,088 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,101 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,109 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,155 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:48:38,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:48:38,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:48:38,269 INFO L202 ElimStorePlain]: Needed 68 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-08 10:48:38,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 90 [2018-12-08 10:48:38,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,392 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 28 treesize of output 7 [2018-12-08 10:48:38,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:48:38,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-08 10:48:38,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 126 [2018-12-08 10:48:38,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,581 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 52 treesize of output 50 [2018-12-08 10:48:38,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 123 [2018-12-08 10:48:38,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 109 [2018-12-08 10:48:38,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:38,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2018-12-08 10:48:38,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:48:38,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:48:38,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:48:38,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:48:38,823 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-08 10:48:38,961 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-08 10:48:38,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 145 [2018-12-08 10:48:38,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:38,990 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 28 treesize of output 7 [2018-12-08 10:48:38,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:39,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:39,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 133 [2018-12-08 10:48:39,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,164 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 28 treesize of output 7 [2018-12-08 10:48:39,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:39,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:39,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 129 [2018-12-08 10:48:39,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,307 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 28 treesize of output 7 [2018-12-08 10:48:39,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:39,334 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:39,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:48:39,421 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:351, output treesize:300 [2018-12-08 10:48:39,552 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-08 10:48:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:48:39,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:48:39,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 108 [2018-12-08 10:48:39,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:39,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 64 treesize of output 97 [2018-12-08 10:48:39,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-12-08 10:48:40,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:40,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 66 treesize of output 69 [2018-12-08 10:48:40,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:40,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:40,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2018-12-08 10:48:40,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-12-08 10:48:40,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:40,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:48:40,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:48:40,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:40,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:48:40,967 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-08 10:48:41,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,137 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 69 treesize of output 72 [2018-12-08 10:48:41,138 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:41,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:48:41,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:48:41,338 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-08 10:48:41,648 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-08 10:48:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:48:41,649 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-12-08 10:48:41,649 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-08 10:48:41,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 23 states and 28 transitions. Complement of second has 5 states. [2018-12-08 10:48:41,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-08 10:48:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 10:48:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-08 10:48:41,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-08 10:48:41,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:48:41,713 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 10:48:41,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:48:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:48:41,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:48:41,840 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 75 treesize of output 68 [2018-12-08 10:48:41,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-12-08 10:48:41,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 72 [2018-12-08 10:48:41,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 82 [2018-12-08 10:48:41,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:41,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 95 [2018-12-08 10:48:42,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 73 [2018-12-08 10:48:42,045 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:42,090 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:42,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:42,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:42,213 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:42,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:42,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:42,366 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 143 [2018-12-08 10:48:43,223 WARN L180 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-08 10:48:43,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-12-08 10:48:43,229 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:43,230 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:48:43,230 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-12-08 10:48:43,234 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:43,400 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 100 treesize of output 99 [2018-12-08 10:48:43,400 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:43,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 121 [2018-12-08 10:48:43,535 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 99 treesize of output 98 [2018-12-08 10:48:43,536 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:46,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:48:46,107 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-08 10:48:49,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:48:49,421 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-08 10:48:51,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2018-12-08 10:48:51,241 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 12 treesize of output 11 [2018-12-08 10:48:51,241 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:51,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:51,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 102 [2018-12-08 10:48:51,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-12-08 10:48:51,278 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:51,296 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:51,303 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:51,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:48:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:48:51,315 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:51,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:51,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:48:51,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:51,344 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:51,355 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:51,363 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2018-12-08 10:48:52,348 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 12 treesize of output 11 [2018-12-08 10:48:52,348 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:52,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 102 [2018-12-08 10:48:52,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:52,383 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,400 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,407 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:48:52,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:48:52,419 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:52,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:48:52,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:52,450 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,461 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,468 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 98 [2018-12-08 10:48:52,780 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 12 treesize of output 11 [2018-12-08 10:48:52,780 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:48:52,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 118 [2018-12-08 10:48:52,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:48:52,826 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,854 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:52,860 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:48:53,077 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:48:53,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 118 [2018-12-08 10:48:53,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 107 [2018-12-08 10:48:53,247 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-08 10:48:57,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 78 [2018-12-08 10:48:57,662 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-12-08 10:49:00,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-12-08 10:49:00,925 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:04,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:49:04,192 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 12 treesize of output 11 [2018-12-08 10:49:04,192 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:04,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:04,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 101 [2018-12-08 10:49:04,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:04,229 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:04,246 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:04,252 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:06,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 96 [2018-12-08 10:49:06,330 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 12 treesize of output 11 [2018-12-08 10:49:06,330 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:06,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:06,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 109 [2018-12-08 10:49:06,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:06,372 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:06,390 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:06,398 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:06,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:49:06,417 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 12 treesize of output 11 [2018-12-08 10:49:06,417 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:06,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:06,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 98 [2018-12-08 10:49:06,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:06,454 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:06,470 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:06,477 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:07,748 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:49:07,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 104 [2018-12-08 10:49:07,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:49:07,768 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:07,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:07,799 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:49:07,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 124 [2018-12-08 10:49:07,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:07,816 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:07,840 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:07,846 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:08,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:49:08,731 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 12 treesize of output 11 [2018-12-08 10:49:08,731 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:08,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:08,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 101 [2018-12-08 10:49:08,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:08,770 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:08,788 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:08,794 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 97 [2018-12-08 10:49:09,345 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 12 treesize of output 11 [2018-12-08 10:49:09,345 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:09,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 117 [2018-12-08 10:49:09,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:09,392 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,414 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,420 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:49:09,760 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 12 treesize of output 11 [2018-12-08 10:49:09,761 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:09,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:49:09,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:09,789 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,800 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,807 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:49:09,823 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 12 treesize of output 11 [2018-12-08 10:49:09,823 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:09,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:49:09,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:09,852 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,864 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,871 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:09,912 INFO L267 ElimStorePlain]: Start of recursive call 37: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 10:49:09,977 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:49:10,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:49:10,023 INFO L202 ElimStorePlain]: Needed 72 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-08 10:49:10,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 90 [2018-12-08 10:49:10,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,120 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 28 treesize of output 7 [2018-12-08 10:49:10,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:10,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:10,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:49:10,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-08 10:49:10,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 126 [2018-12-08 10:49:10,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-12-08 10:49:10,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:10,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 123 [2018-12-08 10:49:10,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 109 [2018-12-08 10:49:10,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:10,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2018-12-08 10:49:10,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:49:10,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:49:10,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:49:10,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:49:10,525 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-08 10:49:10,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 145 [2018-12-08 10:49:10,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 10:49:10,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:10,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:10,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 129 [2018-12-08 10:49:10,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,835 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 28 treesize of output 7 [2018-12-08 10:49:10,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:10,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:10,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 133 [2018-12-08 10:49:10,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:10,979 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 28 treesize of output 7 [2018-12-08 10:49:10,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:11,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:11,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:49:11,096 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:351, output treesize:300 [2018-12-08 10:49:11,231 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-08 10:49:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:49:11,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:49:11,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:11,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:11,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:11,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 108 [2018-12-08 10:49:11,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:11,311 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 84 treesize of output 77 [2018-12-08 10:49:11,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:11,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:11,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2018-12-08 10:49:11,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 10:49:11,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:11,793 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 69 treesize of output 72 [2018-12-08 10:49:11,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:11,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:11,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2018-12-08 10:49:11,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:49:12,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:49:12,092 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-08 10:49:12,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 52 treesize of output 85 [2018-12-08 10:49:12,206 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 9 xjuncts. [2018-12-08 10:49:12,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:49:12,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:49:12,399 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-08 10:49:12,695 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-08 10:49:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:49:12,695 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2018-12-08 10:49:12,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-08 10:49:12,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 23 states and 28 transitions. Complement of second has 5 states. [2018-12-08 10:49:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-08 10:49:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 10:49:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-08 10:49:12,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-08 10:49:12,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:49:12,754 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 10:49:12,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:49:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:49:12,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:49:12,865 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 75 treesize of output 68 [2018-12-08 10:49:12,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-12-08 10:49:12,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 72 [2018-12-08 10:49:12,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 82 [2018-12-08 10:49:12,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:12,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 95 [2018-12-08 10:49:13,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 73 [2018-12-08 10:49:13,032 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:13,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:13,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:13,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:13,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:13,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:13,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:13,310 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 143 [2018-12-08 10:49:14,022 WARN L180 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-08 10:49:14,025 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 112 treesize of output 111 [2018-12-08 10:49:14,025 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:14,026 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:49:14,026 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:14,028 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 112 treesize of output 111 [2018-12-08 10:49:14,028 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:14,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 101 [2018-12-08 10:49:14,187 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:14,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 118 [2018-12-08 10:49:14,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 106 [2018-12-08 10:49:14,335 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-12-08 10:49:19,596 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 70 treesize of output 69 [2018-12-08 10:49:19,596 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:22,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 79 [2018-12-08 10:49:22,813 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-08 10:49:26,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 95 [2018-12-08 10:49:26,550 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 12 treesize of output 11 [2018-12-08 10:49:26,551 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:26,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:26,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 108 [2018-12-08 10:49:26,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:26,589 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:26,606 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:26,613 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:28,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:49:28,972 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 12 treesize of output 11 [2018-12-08 10:49:28,972 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:28,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:29,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 98 [2018-12-08 10:49:29,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:29,012 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:29,030 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:29,037 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:29,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 96 [2018-12-08 10:49:29,059 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 12 treesize of output 11 [2018-12-08 10:49:29,059 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:29,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:29,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 109 [2018-12-08 10:49:29,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:29,100 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:29,120 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:29,127 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:30,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 104 [2018-12-08 10:49:30,187 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 12 treesize of output 11 [2018-12-08 10:49:30,187 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:30,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:30,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 124 [2018-12-08 10:49:30,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:30,237 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:30,260 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:30,267 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:30,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 107 [2018-12-08 10:49:30,729 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 12 treesize of output 11 [2018-12-08 10:49:30,729 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:30,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:30,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 127 [2018-12-08 10:49:30,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:30,774 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:30,797 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:30,803 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:49:31,014 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 12 treesize of output 11 [2018-12-08 10:49:31,014 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:31,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 101 [2018-12-08 10:49:31,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:31,054 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,072 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,086 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 97 [2018-12-08 10:49:31,263 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 12 treesize of output 11 [2018-12-08 10:49:31,264 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:31,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 117 [2018-12-08 10:49:31,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:31,317 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,340 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,347 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:49:31,512 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 12 treesize of output 11 [2018-12-08 10:49:31,512 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:31,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:49:31,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:31,541 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,553 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,560 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:49:31,575 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 12 treesize of output 11 [2018-12-08 10:49:31,575 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:31,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:49:31,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:31,603 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,616 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,622 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:31,702 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 10:49:31,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 117 [2018-12-08 10:49:31,840 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 95 treesize of output 94 [2018-12-08 10:49:31,841 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:36,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:49:36,447 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-12-08 10:49:39,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:49:39,596 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-12-08 10:49:43,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 78 [2018-12-08 10:49:43,193 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 4 xjuncts. [2018-12-08 10:49:47,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 101 [2018-12-08 10:49:47,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:49:47,455 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:47,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:47,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 121 [2018-12-08 10:49:47,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:47,502 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:47,526 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:47,534 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:50,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 101 [2018-12-08 10:49:50,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:49:50,029 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:50,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:50,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 121 [2018-12-08 10:49:50,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-12-08 10:49:50,077 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:50,101 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:50,108 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:51,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 98 [2018-12-08 10:49:51,550 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 12 treesize of output 11 [2018-12-08 10:49:51,551 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:51,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:51,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 118 [2018-12-08 10:49:51,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:51,596 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:51,618 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:51,625 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:52,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:49:52,438 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 12 treesize of output 11 [2018-12-08 10:49:52,438 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:52,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:52,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:49:52,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:52,466 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:52,479 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:52,486 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2018-12-08 10:49:53,035 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 12 treesize of output 11 [2018-12-08 10:49:53,035 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:53,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 82 [2018-12-08 10:49:53,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:53,065 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,079 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,086 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:49:53,101 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 12 treesize of output 11 [2018-12-08 10:49:53,101 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:53,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:49:53,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:53,130 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,142 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,149 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-12-08 10:49:53,163 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 12 treesize of output 11 [2018-12-08 10:49:53,163 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:53,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:49:53,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:53,190 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,217 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,224 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-12-08 10:49:53,532 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 12 treesize of output 11 [2018-12-08 10:49:53,532 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:53,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:49:53,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:49:53,561 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,573 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,580 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,628 INFO L267 ElimStorePlain]: Start of recursive call 53: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:49:53,681 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:49:53,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:49:53,730 INFO L202 ElimStorePlain]: Needed 89 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-08 10:49:53,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:53,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 90 [2018-12-08 10:49:53,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:53,829 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 28 treesize of output 7 [2018-12-08 10:49:53,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:53,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:49:53,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-08 10:49:53,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:53,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 126 [2018-12-08 10:49:54,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,028 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 52 treesize of output 50 [2018-12-08 10:49:54,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:54,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 123 [2018-12-08 10:49:54,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 109 [2018-12-08 10:49:54,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:54,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2018-12-08 10:49:54,184 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:49:54,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:49:54,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:49:54,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:49:54,294 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-08 10:49:54,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 145 [2018-12-08 10:49:54,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,436 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 28 treesize of output 7 [2018-12-08 10:49:54,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:54,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:54,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 133 [2018-12-08 10:49:54,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,603 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 28 treesize of output 7 [2018-12-08 10:49:54,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:54,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:54,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 129 [2018-12-08 10:49:54,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:54,746 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 28 treesize of output 7 [2018-12-08 10:49:54,746 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:54,772 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:49:54,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:49:54,857 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:351, output treesize:300 [2018-12-08 10:49:54,998 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-08 10:49:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:49:55,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:49:55,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:55,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:55,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:55,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 108 [2018-12-08 10:49:55,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:55,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 87 [2018-12-08 10:49:55,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-08 10:49:55,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:55,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2018-12-08 10:49:55,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 10:49:56,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:56,059 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 69 treesize of output 72 [2018-12-08 10:49:56,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:56,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:56,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:49:56,218 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:49:56,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:56,368 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 62 treesize of output 65 [2018-12-08 10:49:56,368 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:49:56,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:49:56,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 52 treesize of output 85 [2018-12-08 10:49:56,487 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 9 xjuncts. [2018-12-08 10:49:56,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:49:56,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:49:56,687 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-08 10:49:57,409 WARN L180 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-08 10:49:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:49:57,410 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-12-08 10:49:57,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-08 10:49:57,631 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 36 states and 44 transitions. Complement of second has 12 states. [2018-12-08 10:49:57,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-08 10:49:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 10:49:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-12-08 10:49:57,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-08 10:49:57,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:49:57,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 10:49:57,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:49:57,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 10:49:57,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:49:57,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-08 10:49:57,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:49:57,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-12-08 10:49:57,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 10:49:57,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-08 10:49:57,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-12-08 10:49:57,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:49:57,633 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-12-08 10:49:57,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-12-08 10:49:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-08 10:49:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-08 10:49:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-12-08 10:49:57,635 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-08 10:49:57,635 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-08 10:49:57,635 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 10:49:57,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-12-08 10:49:57,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:49:57,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:49:57,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:49:57,636 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1] [2018-12-08 10:49:57,636 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:49:57,636 INFO L794 eck$LassoCheckResult]: Stem: 1850#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1843#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1844#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1862#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1861#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 1856#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1848#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1851#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 1854#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1859#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1858#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 1845#L560-2 [2018-12-08 10:49:57,636 INFO L796 eck$LassoCheckResult]: Loop: 1845#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1846#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1857#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 1845#L560-2 [2018-12-08 10:49:57,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:49:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash 47257511, now seen corresponding path program 3 times [2018-12-08 10:49:57,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:49:57,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:49:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:49:57,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:49:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:49:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:49:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:49:57,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:49:57,679 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 4 times [2018-12-08 10:49:57,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:49:57,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:49:57,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:49:57,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:49:57,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:49:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:49:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:49:57,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:49:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash -900755771, now seen corresponding path program 3 times [2018-12-08 10:49:57,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:49:57,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:49:57,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:49:57,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:49:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:49:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:49:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:50:11,960 WARN L180 SmtUtils]: Spent 14.15 s on a formula simplification. DAG size of input: 265 DAG size of output: 228 [2018-12-08 10:50:17,723 WARN L180 SmtUtils]: Spent 5.76 s on a formula simplification that was a NOOP. DAG size: 185 [2018-12-08 10:50:17,727 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:50:17,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:50:17,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:50:17,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:50:17,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:50:17,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:50:17,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:50:17,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:50:17,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-08 10:50:17,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:50:17,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:50:17,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:17,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-12-08 10:50:17,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-12-08 10:50:17,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-12-08 10:50:17,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:17,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:17,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:17,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:17,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:17,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:17,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:17,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:22,841 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 128 [2018-12-08 10:50:22,982 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2018-12-08 10:50:22,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:22,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:22,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:22,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:22,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:22,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:22,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:22,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:50:23,186 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-12-08 10:50:23,496 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:50:23,496 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:50:23,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:50:23,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:50:23,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:50:23,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:50:23,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:50:23,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:50:23,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:50:23,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:50:23,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:50:23,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:50:23,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:50:23,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:50:23,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:50:23,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:50:23,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:50:23,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:50:23,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:50:23,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:50:23,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:50:23,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:50:23,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:50:23,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:50:23,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,516 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:50:23,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,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-12-08 10:50:23,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,537 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:50:23,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,537 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:50:23,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,539 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:50:23,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,540 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:50:23,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:50:23,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:50:23,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:50:23,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:50:23,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:50:23,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:50:23,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:50:23,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:50:23,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:50:23,551 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 10:50:23,552 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 10:50:23,552 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:50:23,552 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-08 10:50:23,552 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:50:23,552 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_main_~w~0.base) ULTIMATE.start_main_~w~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 8*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~w~0.base) ULTIMATE.start_main_~w~0.offset)_4 - 8*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~w~0.base) ULTIMATE.start_main_~w~0.offset)_4 - 4 >= 0] [2018-12-08 10:50:24,011 INFO L297 tatePredicateManager]: 104 out of 110 supporting invariants were superfluous and have been removed [2018-12-08 10:50:24,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:50:24,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:50:24,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:50:24,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:50:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:50:24,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:50:24,145 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 75 treesize of output 68 [2018-12-08 10:50:24,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-12-08 10:50:24,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 72 [2018-12-08 10:50:24,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 82 [2018-12-08 10:50:24,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 95 [2018-12-08 10:50:24,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 73 [2018-12-08 10:50:24,358 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:24,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:24,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:24,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:24,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:24,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:24,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:24,646 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 143 [2018-12-08 10:50:25,507 WARN L180 SmtUtils]: Spent 859.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-08 10:50:25,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-12-08 10:50:25,512 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:25,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-12-08 10:50:25,517 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:25,518 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:50:25,518 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:25,665 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 100 treesize of output 99 [2018-12-08 10:50:25,665 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:25,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 121 [2018-12-08 10:50:25,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 101 [2018-12-08 10:50:25,797 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-08 10:50:30,286 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 71 treesize of output 70 [2018-12-08 10:50:30,286 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:32,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:50:32,501 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-08 10:50:37,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 105 [2018-12-08 10:50:37,402 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 12 treesize of output 11 [2018-12-08 10:50:37,402 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:37,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:37,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 125 [2018-12-08 10:50:37,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:37,447 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:37,472 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:37,480 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:39,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 96 [2018-12-08 10:50:39,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:50:39,029 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:39,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:39,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 105 [2018-12-08 10:50:39,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:39,068 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:39,086 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:39,094 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:39,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 101 [2018-12-08 10:50:39,863 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 12 treesize of output 11 [2018-12-08 10:50:39,863 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:39,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:39,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 121 [2018-12-08 10:50:39,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:39,911 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:39,934 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:39,941 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:50:40,237 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 12 treesize of output 11 [2018-12-08 10:50:40,237 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:40,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:50:40,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-12-08 10:50:40,264 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,278 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,285 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:50:40,584 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 12 treesize of output 11 [2018-12-08 10:50:40,584 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:40,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:50:40,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:40,611 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,623 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,629 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 98 [2018-12-08 10:50:40,724 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 12 treesize of output 11 [2018-12-08 10:50:40,724 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:40,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 118 [2018-12-08 10:50:40,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:40,773 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,801 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,808 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:40,881 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:50:41,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 118 [2018-12-08 10:50:41,022 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 98 treesize of output 97 [2018-12-08 10:50:41,022 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:45,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 79 [2018-12-08 10:50:45,120 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-12-08 10:50:48,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 78 [2018-12-08 10:50:48,065 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 4 xjuncts. [2018-12-08 10:50:51,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 104 [2018-12-08 10:50:51,735 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 12 treesize of output 11 [2018-12-08 10:50:51,736 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:51,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:51,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 124 [2018-12-08 10:50:51,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:51,787 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:51,812 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:51,820 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:54,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:50:54,417 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 12 treesize of output 11 [2018-12-08 10:50:54,417 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:54,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:54,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 101 [2018-12-08 10:50:54,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:54,455 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:54,473 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:54,482 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:55,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:50:55,837 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 12 treesize of output 11 [2018-12-08 10:50:55,837 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:55,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:55,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 98 [2018-12-08 10:50:55,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:55,878 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:55,899 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:55,906 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:55,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 96 [2018-12-08 10:50:55,927 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 12 treesize of output 11 [2018-12-08 10:50:55,927 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:55,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:55,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 109 [2018-12-08 10:50:55,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:55,966 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:55,985 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:55,992 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:56,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:50:56,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 12 treesize of output 11 [2018-12-08 10:50:56,570 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:56,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:56,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 101 [2018-12-08 10:50:56,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:56,635 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:56,652 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:56,659 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:50:57,108 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 12 treesize of output 11 [2018-12-08 10:50:57,108 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:50:57,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:57,136 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,148 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,155 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:50:57,168 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 12 treesize of output 11 [2018-12-08 10:50:57,168 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:50:57,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:57,196 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,208 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,215 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 97 [2018-12-08 10:50:57,353 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 12 treesize of output 11 [2018-12-08 10:50:57,353 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 117 [2018-12-08 10:50:57,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:50:57,399 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,420 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,425 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,547 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 10:50:57,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:50:57,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:50:57,662 INFO L202 ElimStorePlain]: Needed 76 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-08 10:50:57,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 90 [2018-12-08 10:50:57,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,757 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 28 treesize of output 7 [2018-12-08 10:50:57,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:57,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:50:57,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-08 10:50:57,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 126 [2018-12-08 10:50:57,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:57,947 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 52 treesize of output 50 [2018-12-08 10:50:57,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:58,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 123 [2018-12-08 10:50:58,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 109 [2018-12-08 10:50:58,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:58,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2018-12-08 10:50:58,095 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:50:58,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:50:58,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:50:58,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:50:58,187 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-08 10:50:58,322 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-08 10:50:58,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 138 [2018-12-08 10:50:58,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 10:50:58,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:58,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:58,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 126 [2018-12-08 10:50:58,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,503 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 28 treesize of output 7 [2018-12-08 10:50:58,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:58,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:58,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 122 [2018-12-08 10:50:58,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:58,636 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 28 treesize of output 7 [2018-12-08 10:50:58,636 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:58,660 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:58,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:50:58,742 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:330, output treesize:279 [2018-12-08 10:50:58,944 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-08 10:50:59,584 WARN L180 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-08 10:50:59,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:59,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 150 [2018-12-08 10:50:59,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:59,609 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 54 treesize of output 52 [2018-12-08 10:50:59,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:59,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:59,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 90 [2018-12-08 10:50:59,669 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 27 treesize of output 30 [2018-12-08 10:50:59,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:59,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:59,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:59,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:59,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 154 [2018-12-08 10:50:59,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:59,890 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 54 treesize of output 52 [2018-12-08 10:50:59,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:59,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:50:59,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 98 [2018-12-08 10:50:59,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-12-08 10:50:59,951 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:50:59,966 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:50:59,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 186 [2018-12-08 10:51:00,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,142 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 54 treesize of output 52 [2018-12-08 10:51:00,143 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 112 [2018-12-08 10:51:00,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-08 10:51:00,230 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,249 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,277 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:51:00,370 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:471, output treesize:280 [2018-12-08 10:51:00,516 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-08 10:51:00,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 145 [2018-12-08 10:51:00,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,540 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 28 treesize of output 7 [2018-12-08 10:51:00,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 133 [2018-12-08 10:51:00,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,719 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 28 treesize of output 7 [2018-12-08 10:51:00,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 139 [2018-12-08 10:51:00,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:00,864 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 28 treesize of output 7 [2018-12-08 10:51:00,865 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,891 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:00,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:51:00,981 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:353, output treesize:302 [2018-12-08 10:51:01,121 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-08 10:51:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:51:01,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:51:01,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:01,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:01,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:01,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 108 [2018-12-08 10:51:01,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:01,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 87 [2018-12-08 10:51:01,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-08 10:51:01,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:01,542 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 69 treesize of output 72 [2018-12-08 10:51:01,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:01,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:01,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2018-12-08 10:51:01,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-12-08 10:51:01,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:01,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:51:01,946 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:51:02,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:02,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 52 treesize of output 85 [2018-12-08 10:51:02,138 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-12-08 10:51:02,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:02,315 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 62 treesize of output 65 [2018-12-08 10:51:02,315 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:02,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:51:02,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:51:02,494 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-08 10:51:02,790 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-08 10:51:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:51:02,791 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2018-12-08 10:51:02,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-08 10:51:02,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 10 states. Result 27 states and 34 transitions. Complement of second has 5 states. [2018-12-08 10:51:02,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-08 10:51:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 10:51:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-08 10:51:02,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 10:51:02,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:51:02,880 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 10:51:02,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:51:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:51:02,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:51:02,996 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 75 treesize of output 68 [2018-12-08 10:51:03,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-12-08 10:51:03,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 72 [2018-12-08 10:51:03,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 82 [2018-12-08 10:51:03,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 95 [2018-12-08 10:51:03,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 73 [2018-12-08 10:51:03,167 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:03,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:03,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:03,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:03,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:03,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:03,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:03,471 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 143 [2018-12-08 10:51:04,344 WARN L180 SmtUtils]: Spent 871.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-08 10:51:04,349 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 112 treesize of output 111 [2018-12-08 10:51:04,349 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:04,349 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:51:04,349 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:04,353 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 112 treesize of output 111 [2018-12-08 10:51:04,353 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:04,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 101 [2018-12-08 10:51:04,507 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:04,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 118 [2018-12-08 10:51:04,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 117 [2018-12-08 10:51:04,658 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-12-08 10:51:10,040 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 70 treesize of output 69 [2018-12-08 10:51:10,041 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:13,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 78 [2018-12-08 10:51:13,473 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-12-08 10:51:17,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 79 [2018-12-08 10:51:17,481 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-08 10:51:21,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:51:21,904 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 12 treesize of output 11 [2018-12-08 10:51:21,904 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:21,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:21,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:51:21,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:21,936 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:21,952 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:21,960 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:21,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:51:21,976 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 12 treesize of output 11 [2018-12-08 10:51:21,977 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:21,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:22,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:51:22,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:22,010 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:22,024 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:22,032 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:22,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2018-12-08 10:51:22,048 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 12 treesize of output 11 [2018-12-08 10:51:22,048 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:22,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:22,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 82 [2018-12-08 10:51:22,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:22,083 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:22,099 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:22,107 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:25,288 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:51:25,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 118 [2018-12-08 10:51:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:51:25,313 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:25,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:25,344 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:51:25,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 127 [2018-12-08 10:51:25,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:25,361 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:25,385 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:25,392 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:27,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 111 [2018-12-08 10:51:27,287 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 12 treesize of output 11 [2018-12-08 10:51:27,287 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:27,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:27,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 131 [2018-12-08 10:51:27,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:27,336 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:27,360 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:27,368 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:28,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:51:28,634 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 12 treesize of output 11 [2018-12-08 10:51:28,634 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:28,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:28,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 98 [2018-12-08 10:51:28,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:28,672 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:28,693 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:28,700 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:28,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 96 [2018-12-08 10:51:28,723 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 12 treesize of output 11 [2018-12-08 10:51:28,723 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:28,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:28,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 109 [2018-12-08 10:51:28,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:28,761 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:28,780 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:28,788 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 100 [2018-12-08 10:51:29,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:51:29,368 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:29,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 120 [2018-12-08 10:51:29,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:29,419 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,443 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,449 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 84 [2018-12-08 10:51:29,699 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 12 treesize of output 11 [2018-12-08 10:51:29,699 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:29,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 97 [2018-12-08 10:51:29,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:29,737 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,754 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,760 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 97 [2018-12-08 10:51:29,945 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 12 treesize of output 11 [2018-12-08 10:51:29,946 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:29,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:29,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 117 [2018-12-08 10:51:29,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:29,997 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:30,019 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:30,024 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:30,109 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 10:51:30,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 117 [2018-12-08 10:51:30,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 97 [2018-12-08 10:51:30,383 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-12-08 10:51:34,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 67 treesize of output 66 [2018-12-08 10:51:34,988 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:37,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 78 [2018-12-08 10:51:37,823 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 4 xjuncts. [2018-12-08 10:51:41,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:51:41,435 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-12-08 10:51:45,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 102 [2018-12-08 10:51:45,262 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 12 treesize of output 11 [2018-12-08 10:51:45,262 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:45,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:45,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 122 [2018-12-08 10:51:45,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:45,310 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:45,334 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:45,341 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:47,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2018-12-08 10:51:47,877 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 12 treesize of output 11 [2018-12-08 10:51:47,877 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:47,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:47,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 102 [2018-12-08 10:51:47,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:47,914 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:47,932 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:47,940 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:47,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:51:47,953 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 12 treesize of output 11 [2018-12-08 10:51:47,954 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:47,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:47,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:51:47,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:47,983 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:47,996 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:48,003 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:49,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:51:49,142 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 12 treesize of output 11 [2018-12-08 10:51:49,142 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:49,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:49,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 101 [2018-12-08 10:51:49,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:49,181 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:49,199 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:49,206 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:49,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 88 [2018-12-08 10:51:49,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:51:49,770 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:49,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:49,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 101 [2018-12-08 10:51:49,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:49,811 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:49,829 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:49,836 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:51:50,271 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 12 treesize of output 11 [2018-12-08 10:51:50,272 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:50,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:51:50,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:50,301 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,314 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,322 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 85 [2018-12-08 10:51:50,343 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 12 treesize of output 11 [2018-12-08 10:51:50,343 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:50,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 98 [2018-12-08 10:51:50,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:50,383 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,401 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,409 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-12-08 10:51:50,547 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 12 treesize of output 11 [2018-12-08 10:51:50,547 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:50,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:51:50,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:50,574 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,586 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,593 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-12-08 10:51:50,607 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 12 treesize of output 11 [2018-12-08 10:51:50,607 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:50,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:51:50,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:51:50,635 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,649 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,656 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,708 INFO L267 ElimStorePlain]: Start of recursive call 58: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:51:50,738 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:51:50,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:51:50,785 INFO L202 ElimStorePlain]: Needed 98 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-08 10:51:50,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:50,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 90 [2018-12-08 10:51:50,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:50,884 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 28 treesize of output 7 [2018-12-08 10:51:50,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:50,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:51:50,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-08 10:51:51,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 126 [2018-12-08 10:51:51,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,068 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 52 treesize of output 50 [2018-12-08 10:51:51,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:51,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 123 [2018-12-08 10:51:51,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 109 [2018-12-08 10:51:51,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:51,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2018-12-08 10:51:51,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:51:51,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:51:51,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:51:51,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:51:51,320 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-08 10:51:51,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 126 [2018-12-08 10:51:51,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,463 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 28 treesize of output 7 [2018-12-08 10:51:51,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:51,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:51,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 138 [2018-12-08 10:51:51,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,614 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 28 treesize of output 7 [2018-12-08 10:51:51,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:51,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:51,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 122 [2018-12-08 10:51:51,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:51,758 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 28 treesize of output 7 [2018-12-08 10:51:51,758 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:51,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:51,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:51:51,865 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:330, output treesize:279 [2018-12-08 10:51:51,993 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-08 10:51:52,602 WARN L180 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-08 10:51:52,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:52,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 150 [2018-12-08 10:51:52,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:52,627 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 54 treesize of output 52 [2018-12-08 10:51:52,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:52,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:52,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 90 [2018-12-08 10:51:52,686 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 27 treesize of output 30 [2018-12-08 10:51:52,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:52,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:52,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:53,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:53,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 154 [2018-12-08 10:51:53,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:53,177 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 54 treesize of output 52 [2018-12-08 10:51:53,178 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:53,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:53,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 98 [2018-12-08 10:51:53,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-12-08 10:51:53,441 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:53,503 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:53,591 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:53,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:53,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:53,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:53,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 186 [2018-12-08 10:51:53,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:53,810 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 54 treesize of output 52 [2018-12-08 10:51:53,810 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:53,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:53,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 112 [2018-12-08 10:51:53,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-08 10:51:53,887 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:53,905 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:53,931 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:54,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:51:54,014 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:471, output treesize:280 [2018-12-08 10:51:54,179 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-08 10:51:54,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:54,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 133 [2018-12-08 10:51:54,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:54,205 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 28 treesize of output 7 [2018-12-08 10:51:54,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:54,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:54,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:54,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 139 [2018-12-08 10:51:54,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:54,397 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 28 treesize of output 7 [2018-12-08 10:51:54,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:54,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:54,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:54,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 145 [2018-12-08 10:51:54,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:54,585 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 28 treesize of output 7 [2018-12-08 10:51:54,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:54,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:54,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:51:54,755 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:353, output treesize:302 [2018-12-08 10:51:54,994 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-08 10:51:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:51:55,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:51:55,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:55,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:55,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:55,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 108 [2018-12-08 10:51:55,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:55,098 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 84 treesize of output 77 [2018-12-08 10:51:55,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:55,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:55,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2018-12-08 10:51:55,842 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 10:51:56,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:56,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:51:56,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-12-08 10:51:56,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:56,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:51:56,250 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:51:56,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:56,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 52 treesize of output 85 [2018-12-08 10:51:56,599 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-12-08 10:51:57,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:57,117 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 62 treesize of output 65 [2018-12-08 10:51:57,117 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:57,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:51:57,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:51:57,318 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-08 10:51:58,144 WARN L180 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-08 10:51:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:51:58,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 3 loop predicates [2018-12-08 10:51:58,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-08 10:51:58,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 10 states. Result 27 states and 34 transitions. Complement of second has 5 states. [2018-12-08 10:51:58,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-08 10:51:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 10:51:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-08 10:51:58,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 10:51:58,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:51:58,254 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 10:51:58,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:51:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:51:58,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:51:58,388 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 75 treesize of output 68 [2018-12-08 10:51:58,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-12-08 10:51:58,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 72 [2018-12-08 10:51:58,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 82 [2018-12-08 10:51:58,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 95 [2018-12-08 10:51:58,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 73 [2018-12-08 10:51:58,576 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:58,615 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:58,650 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:58,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:58,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:58,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:51:58,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:51:58,873 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 143 [2018-12-08 10:51:59,572 WARN L180 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-08 10:51:59,575 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 112 treesize of output 111 [2018-12-08 10:51:59,576 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:59,578 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 112 treesize of output 111 [2018-12-08 10:51:59,578 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:59,579 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:51:59,579 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:59,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 101 [2018-12-08 10:51:59,720 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 10:51:59,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 121 [2018-12-08 10:51:59,835 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 99 treesize of output 98 [2018-12-08 10:51:59,835 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:05,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:52:05,429 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-08 10:52:07,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2018-12-08 10:52:07,732 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-08 10:52:10,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 105 [2018-12-08 10:52:10,372 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 12 treesize of output 11 [2018-12-08 10:52:10,372 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:10,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:10,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 125 [2018-12-08 10:52:10,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:10,424 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:10,448 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:10,456 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:12,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 96 [2018-12-08 10:52:12,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:52:12,005 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:12,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:12,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 105 [2018-12-08 10:52:12,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:12,042 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:12,061 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:12,069 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:13,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 102 [2018-12-08 10:52:13,057 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 12 treesize of output 11 [2018-12-08 10:52:13,057 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:13,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:13,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 122 [2018-12-08 10:52:13,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:13,101 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:13,125 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:13,132 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:13,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:52:13,700 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 12 treesize of output 11 [2018-12-08 10:52:13,701 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:13,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:13,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:52:13,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:13,729 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:13,741 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:13,747 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 101 [2018-12-08 10:52:14,091 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 12 treesize of output 11 [2018-12-08 10:52:14,091 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:14,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 121 [2018-12-08 10:52:14,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:14,143 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,167 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,174 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 96 [2018-12-08 10:52:14,390 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 12 treesize of output 11 [2018-12-08 10:52:14,390 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:14,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 105 [2018-12-08 10:52:14,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:14,430 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,449 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,457 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-12-08 10:52:14,514 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 12 treesize of output 11 [2018-12-08 10:52:14,514 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:14,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:52:14,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:14,546 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,558 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,565 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:14,612 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:52:14,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 95 [2018-12-08 10:52:14,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 98 [2018-12-08 10:52:14,745 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-12-08 10:52:14,916 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 66 treesize of output 65 [2018-12-08 10:52:14,916 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:52:15,059 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 12 treesize of output 11 [2018-12-08 10:52:15,059 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:15,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:52:15,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:15,092 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,107 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,116 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2018-12-08 10:52:15,134 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 12 treesize of output 11 [2018-12-08 10:52:15,134 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:15,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 82 [2018-12-08 10:52:15,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:15,173 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,191 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,200 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-12-08 10:52:15,219 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 12 treesize of output 11 [2018-12-08 10:52:15,219 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:15,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-12-08 10:52:15,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:15,260 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,276 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,284 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 85 [2018-12-08 10:52:15,425 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 12 treesize of output 11 [2018-12-08 10:52:15,426 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:15,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 98 [2018-12-08 10:52:15,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:52:15,487 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,517 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,528 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,638 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:52:15,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:52:15,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:52:15,822 INFO L202 ElimStorePlain]: Needed 63 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-08 10:52:15,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:15,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 90 [2018-12-08 10:52:15,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:15,923 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 28 treesize of output 7 [2018-12-08 10:52:15,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:15,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:52:15,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-08 10:52:16,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:16,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:16,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:16,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 126 [2018-12-08 10:52:16,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:16,096 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 52 treesize of output 50 [2018-12-08 10:52:16,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:16,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 123 [2018-12-08 10:52:16,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 109 [2018-12-08 10:52:16,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:16,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2018-12-08 10:52:16,261 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-08 10:52:16,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:52:16,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:52:16,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:52:16,394 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-08 10:52:16,830 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-08 10:52:16,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:16,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:16,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 138 [2018-12-08 10:52:16,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:16,944 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 28 treesize of output 7 [2018-12-08 10:52:16,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:17,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:17,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:17,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:17,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 122 [2018-12-08 10:52:17,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:17,878 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 28 treesize of output 7 [2018-12-08 10:52:17,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:17,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:18,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:18,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:18,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 126 [2018-12-08 10:52:18,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:18,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 10:52:18,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:18,045 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:18,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:52:18,129 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:330, output treesize:279 [2018-12-08 10:52:18,926 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-08 10:52:18,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:18,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 154 [2018-12-08 10:52:18,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:18,951 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 54 treesize of output 52 [2018-12-08 10:52:18,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:18,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 98 [2018-12-08 10:52:19,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 20 [2018-12-08 10:52:19,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 186 [2018-12-08 10:52:19,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-12-08 10:52:19,256 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 112 [2018-12-08 10:52:19,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-08 10:52:19,353 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,373 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 150 [2018-12-08 10:52:19,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,540 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 54 treesize of output 52 [2018-12-08 10:52:19,540 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 90 [2018-12-08 10:52:19,599 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 27 treesize of output 30 [2018-12-08 10:52:19,599 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,615 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,635 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:52:19,721 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:471, output treesize:280 [2018-12-08 10:52:19,857 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-08 10:52:19,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 145 [2018-12-08 10:52:19,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:19,881 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 28 treesize of output 7 [2018-12-08 10:52:19,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:19,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:20,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:20,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 133 [2018-12-08 10:52:20,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:20,086 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 28 treesize of output 7 [2018-12-08 10:52:20,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:20,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:20,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:20,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 139 [2018-12-08 10:52:20,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:20,553 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 28 treesize of output 7 [2018-12-08 10:52:20,553 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:20,694 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:21,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:52:21,222 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:353, output treesize:302 [2018-12-08 10:52:22,059 WARN L180 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-08 10:52:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:22,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:52:22,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:22,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:22,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:22,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 108 [2018-12-08 10:52:22,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:22,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 64 treesize of output 97 [2018-12-08 10:52:22,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-12-08 10:52:23,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2018-12-08 10:52:23,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:24,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:24,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2018-12-08 10:52:24,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-12-08 10:52:25,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:25,566 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 62 treesize of output 65 [2018-12-08 10:52:25,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:25,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:25,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:52:25,844 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-08 10:52:25,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:25,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-08 10:52:25,998 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-12-08 10:52:26,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:52:26,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-08 10:52:26,181 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-08 10:52:26,894 WARN L180 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-08 10:52:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:52:26,895 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2018-12-08 10:52:26,896 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-08 10:52:27,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 10 states. Result 41 states and 50 transitions. Complement of second has 15 states. [2018-12-08 10:52:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2018-12-08 10:52:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 10:52:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-12-08 10:52:27,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 10:52:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:52:27,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 10:52:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:52:27,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-08 10:52:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:52:27,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2018-12-08 10:52:27,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 10:52:27,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 50 transitions. [2018-12-08 10:52:27,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 10:52:27,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-08 10:52:27,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2018-12-08 10:52:27,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:52:27,278 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-12-08 10:52:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2018-12-08 10:52:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 23. [2018-12-08 10:52:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 10:52:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-08 10:52:27,280 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-08 10:52:27,280 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-08 10:52:27,280 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 10:52:27,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-08 10:52:27,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:52:27,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:52:27,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:52:27,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2018-12-08 10:52:27,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:52:27,283 INFO L794 eck$LassoCheckResult]: Stem: 2617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2610#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 2611#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2631#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2632#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 2624#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2620#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2621#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 2623#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2627#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2626#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 2612#L560-2 [2018-12-08 10:52:27,283 INFO L796 eck$LassoCheckResult]: Loop: 2612#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2613#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2625#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 2612#L560-2 [2018-12-08 10:52:27,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash 47317093, now seen corresponding path program 4 times [2018-12-08 10:52:27,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:27,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:52:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:52:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:52:27,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:52:27,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_559ebc65-768d-4f6f-8ed4-173ec30b81a7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:52:27,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 10:52:27,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 10:52:27,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:52:27,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:52:27,413 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 44 treesize of output 43 [2018-12-08 10:52:27,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-08 10:52:27,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-12-08 10:52:27,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-12-08 10:52:27,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2018-12-08 10:52:27,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-12-08 10:52:27,480 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,491 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,549 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:44, output treesize:13 [2018-12-08 10:52:27,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,570 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 25 treesize of output 34 [2018-12-08 10:52:27,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:52:27,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-08 10:52:27,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:12 [2018-12-08 10:52:27,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-12-08 10:52:27,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-08 10:52:27,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:52:27,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2018-12-08 10:52:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:52:27,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:52:27,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-08 10:52:27,623 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 10:52:27,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:27,623 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 5 times [2018-12-08 10:52:27,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:27,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:27,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:52:27,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:52:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:52:27,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:52:27,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:52:27,710 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-12-08 10:52:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:52:27,791 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-08 10:52:27,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:52:27,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-12-08 10:52:27,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 10:52:27,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 20 states and 21 transitions. [2018-12-08 10:52:27,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 10:52:27,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 10:52:27,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-12-08 10:52:27,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:52:27,793 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-08 10:52:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-12-08 10:52:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-08 10:52:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-08 10:52:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-08 10:52:27,795 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-08 10:52:27,795 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-08 10:52:27,795 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 10:52:27,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2018-12-08 10:52:27,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 10:52:27,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:52:27,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:52:27,796 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1] [2018-12-08 10:52:27,796 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:52:27,796 INFO L794 eck$LassoCheckResult]: Stem: 2718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2715#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 2716#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2717#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2719#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 2720#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2734#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2733#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 2732#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2731#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2730#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 2729#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2728#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2727#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 2724#L560-2 [2018-12-08 10:52:27,796 INFO L796 eck$LassoCheckResult]: Loop: 2724#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2726#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 2723#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 2724#L560-2 [2018-12-08 10:52:27,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash -900755773, now seen corresponding path program 4 times [2018-12-08 10:52:27,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:27,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:52:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:52:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:52:27,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-12-08 10:52:27,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:27,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:52:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:52:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:52:27,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:52:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash 540439079, now seen corresponding path program 5 times [2018-12-08 10:52:27,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:52:27,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:52:27,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:52:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:52:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:52:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:52:59,325 WARN L180 SmtUtils]: Spent 31.29 s on a formula simplification. DAG size of input: 296 DAG size of output: 257 [2018-12-08 10:53:11,907 WARN L180 SmtUtils]: Spent 12.58 s on a formula simplification that was a NOOP. DAG size: 200 [2018-12-08 10:53:11,911 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:53:11,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:53:11,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:53:11,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:53:11,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:53:11,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:53:11,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:53:11,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:53:11,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-08 10:53:11,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:53:11,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:53:11,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:53:11,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:53:11,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:53:11,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:53:11,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:53:11,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,138 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 130 [2018-12-08 10:54:32,295 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-08 10:54:32,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:54:32,735 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:54:32,735 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:54:32,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:32,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:32,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:32,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:32,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:32,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:32,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:54:32,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:54:32,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:54:32,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,742 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:54:32,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,742 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:54:32,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:54:32,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:54:32,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,746 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:54:32,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,746 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:54:32,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,754 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:54:32,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,754 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:54:32,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,767 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:54:32,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,768 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:54:32,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,771 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:54:32,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,771 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:54:32,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:54:32,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:54:32,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:54:32,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:54:32,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:54:32,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:54:32,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:54:32,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:54:32,798 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:54:32,803 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 10:54:32,803 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 10:54:32,804 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:54:32,804 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 10:54:32,804 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:54:32,804 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_5 Supporting invariants [] [2018-12-08 10:54:33,440 INFO L297 tatePredicateManager]: 113 out of 116 supporting invariants were superfluous and have been removed [2018-12-08 10:54:33,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 10:54:33,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:33,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:33,478 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 55 treesize of output 51 [2018-12-08 10:54:33,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,487 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 48 treesize of output 61 [2018-12-08 10:54:33,490 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-12-08 10:54:33,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 48 [2018-12-08 10:54:33,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-12-08 10:54:33,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 53 [2018-12-08 10:54:33,545 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,568 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,615 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:59, output treesize:17 [2018-12-08 10:54:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:54:33,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:54:33,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,633 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 25 treesize of output 34 [2018-12-08 10:54:33,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:54:33,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-08 10:54:33,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:54:33,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2018-12-08 10:54:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:54:33,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 10:54:33,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-08 10:54:33,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 28 states and 29 transitions. Complement of second has 8 states. [2018-12-08 10:54:33,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 10:54:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 10:54:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-08 10:54:33,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 10:54:33,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:33,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-08 10:54:33,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:33,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 10:54:33,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:54:33,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-12-08 10:54:33,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:54:33,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 23 transitions. [2018-12-08 10:54:33,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 10:54:33,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 10:54:33,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2018-12-08 10:54:33,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 10:54:33,681 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-08 10:54:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2018-12-08 10:54:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-08 10:54:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-08 10:54:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-08 10:54:33,682 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-08 10:54:33,682 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-08 10:54:33,682 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 10:54:33,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-12-08 10:54:33,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 10:54:33,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 10:54:33,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 10:54:33,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1] [2018-12-08 10:54:33,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 10:54:33,683 INFO L794 eck$LassoCheckResult]: Stem: 3316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3310#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 3311#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3324#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 3320#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 3312#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3313#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 3321#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 3322#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3326#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 3327#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 3314#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3315#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 3319#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;havoc main_#t~mem18; 3325#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3317#L558-1 [2018-12-08 10:54:33,683 INFO L796 eck$LassoCheckResult]: Loop: 3317#L558-1 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem12;havoc main_#t~mem13;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 3318#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 3323#L560-2 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3317#L558-1 [2018-12-08 10:54:33,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:33,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342116, now seen corresponding path program 6 times [2018-12-08 10:54:33,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:33,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:33,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 41857, now seen corresponding path program 6 times [2018-12-08 10:54:33,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:33,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:54:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash -426257666, now seen corresponding path program 5 times [2018-12-08 10:54:33,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:54:33,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:54:33,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:54:33,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:54:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:54:57,334 WARN L180 SmtUtils]: Spent 23.41 s on a formula simplification. DAG size of input: 304 DAG size of output: 265 [2018-12-08 10:55:10,622 WARN L180 SmtUtils]: Spent 13.29 s on a formula simplification that was a NOOP. DAG size: 208 [2018-12-08 10:55:10,626 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 10:55:10,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 10:55:10,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 10:55:10,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 10:55:10,627 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 10:55:10,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 10:55:10,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 10:55:10,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 10:55:10,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-08 10:55:10,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 10:55:10,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 10:55:10,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:55:10,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:55:10,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:55:10,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:55:10,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,700 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 133 [2018-12-08 10:56:30,867 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-08 10:56:30,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:30,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 10:56:31,100 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-12-08 10:56:31,382 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 10:56:31,383 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 10:56:31,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:56:31,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:56:31,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:56:31,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:56:31,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:56:31,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:56:31,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:56:31,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:56:31,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:56:31,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:56:31,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 10:56:31,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:56:31,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:56:31,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:56:31,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 10:56:31,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 10:56:31,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:56:31,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:56:31,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:56:31,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:56:31,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:56:31,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:56:31,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:56:31,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:56:31,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:56:31,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:56:31,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:56:31,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:56:31,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:56:31,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:56:31,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:56:31,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:56:31,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:56:31,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:56:31,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:56:31,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:56:31,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:56:31,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:56:31,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:56:31,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:56:31,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:56:31,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:56:31,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:56:31,389 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:56:31,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:56:31,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:56:31,390 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:56:31,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:56:31,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:56:31,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:56:31,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:56:31,391 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 10:56:31,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:56:31,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:56:31,392 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 10:56:31,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:56:31,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 10:56:31,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 10:56:31,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 10:56:31,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 10:56:31,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 10:56:31,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 10:56:31,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 10:56:31,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 10:56:31,399 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 10:56:31,403 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 10:56:31,403 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 10:56:31,403 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 10:56:31,404 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-08 10:56:31,404 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 10:56:31,404 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~mem13) = 2*ULTIMATE.start_main_#t~mem12 - 2*ULTIMATE.start_main_#t~mem13 + 1 Supporting invariants [1*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_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6 - 1*ULTIMATE.start_main_#t~mem13 + 1*ULTIMATE.start_main_#t~mem12 >= 0] [2018-12-08 10:56:31,936 INFO L297 tatePredicateManager]: 111 out of 117 supporting invariants were superfluous and have been removed [2018-12-08 10:56:31,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:31,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:31,982 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 58 treesize of output 54 [2018-12-08 10:56:31,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-08 10:56:31,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:31,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:31,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:31,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 64 [2018-12-08 10:56:32,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-12-08 10:56:32,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2018-12-08 10:56:32,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2018-12-08 10:56:32,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,077 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,143 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2018-12-08 10:56:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:32,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:32,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 61 [2018-12-08 10:56:32,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-12-08 10:56:32,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 49 [2018-12-08 10:56:32,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 10:56:32,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:56:32,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:32,245 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:153 [2018-12-08 10:56:32,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,325 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-12-08 10:56:32,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,327 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 36 treesize of output 27 [2018-12-08 10:56:32,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:32,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-12-08 10:56:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:32,365 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-08 10:56:32,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-08 10:56:32,408 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 19 states and 20 transitions. Complement of second has 6 states. [2018-12-08 10:56:32,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 10:56:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 10:56:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-08 10:56:32,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 10:56:32,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:56:32,409 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 10:56:32,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:32,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:32,451 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 58 treesize of output 54 [2018-12-08 10:56:32,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-08 10:56:32,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 64 [2018-12-08 10:56:32,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-12-08 10:56:32,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2018-12-08 10:56:32,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2018-12-08 10:56:32,527 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,543 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,555 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,608 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2018-12-08 10:56:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:32,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:32,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,644 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 33 treesize of output 61 [2018-12-08 10:56:32,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-12-08 10:56:32,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 49 [2018-12-08 10:56:32,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 10:56:32,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:56:32,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:32,710 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:153 [2018-12-08 10:56:32,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,787 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-12-08 10:56:32,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,790 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 36 treesize of output 27 [2018-12-08 10:56:32,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:32,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:32,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-12-08 10:56:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:32,823 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-08 10:56:32,823 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-08 10:56:32,866 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 19 states and 20 transitions. Complement of second has 6 states. [2018-12-08 10:56:32,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 10:56:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 10:56:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-08 10:56:32,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 10:56:32,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:56:32,867 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 10:56:32,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:32,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:32,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-12-08 10:56:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-08 10:56:32,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 64 [2018-12-08 10:56:32,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-12-08 10:56:32,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2018-12-08 10:56:32,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:32,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2018-12-08 10:56:32,984 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,000 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,067 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2018-12-08 10:56:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:33,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:33,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:33,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:33,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:33,101 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 33 treesize of output 61 [2018-12-08 10:56:33,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:33,104 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 50 treesize of output 43 [2018-12-08 10:56:33,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:33,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 49 [2018-12-08 10:56:33,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 10:56:33,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:56:33,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:33,180 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:153 [2018-12-08 10:56:33,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:33,242 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-12-08 10:56:33,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:33,245 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 36 treesize of output 27 [2018-12-08 10:56:33,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:33,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:33,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-12-08 10:56:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:33,281 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-08 10:56:33,282 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-08 10:56:33,348 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 25 states and 27 transitions. Complement of second has 7 states. [2018-12-08 10:56:33,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 10:56:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 10:56:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-08 10:56:33,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 10:56:33,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:56:33,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 10:56:33,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:56:33,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-08 10:56:33,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 10:56:33,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2018-12-08 10:56:33,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:56:33,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-12-08 10:56:33,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 10:56:33,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 10:56:33,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 10:56:33,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 10:56:33,350 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:56:33,350 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:56:33,350 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:56:33,350 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 10:56:33,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 10:56:33,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 10:56:33,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 10:56:33,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 10:56:33 BoogieIcfgContainer [2018-12-08 10:56:33,356 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 10:56:33,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:56:33,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:56:33,357 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:56:33,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:48:01" (3/4) ... [2018-12-08 10:56:33,360 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 10:56:33,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:56:33,360 INFO L168 Benchmark]: Toolchain (without parser) took 512756.45 ms. Allocated memory was 1.0 GB in the beginning and 11.5 GB in the end (delta: 10.5 GB). Free memory was 950.6 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.4 GB. Max. memory is 11.5 GB. [2018-12-08 10:56:33,361 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:56:33,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 10:56:33,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 10:56:33,361 INFO L168 Benchmark]: Boogie Preprocessor took 14.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:56:33,361 INFO L168 Benchmark]: RCFGBuilder took 171.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2018-12-08 10:56:33,362 INFO L168 Benchmark]: BuchiAutomizer took 512287.29 ms. Allocated memory was 1.1 GB in the beginning and 11.5 GB in the end (delta: 10.4 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 8.4 GB. Max. memory is 11.5 GB. [2018-12-08 10:56:33,362 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 11.5 GB. Free memory is still 3.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:56:33,363 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 171.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 512287.29 ms. Allocated memory was 1.1 GB in the beginning and 11.5 GB in the end (delta: 10.4 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 8.4 GB. Max. memory is 11.5 GB. * Witness Printer took 3.38 ms. Allocated memory is still 11.5 GB. Free memory is still 3.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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, 3 deterministic, 3 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x][x] + -2 * unknown-#memory_int-unknown[y][y] + 1 and consists of 6 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[w][w] + 6 * unknown-#memory_int-unknown[x][x] + -6 * unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function 8 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[w][w] + -8 * unknown-#memory_int-unknown[y][y] and consists of 11 locations. One nondeterministic module has affine ranking function 2 * aux-x-aux + -2 * aux-y-aux + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 512.2s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 290.5s. Construction of modules took 0.6s. Büchi inclusion checks took 220.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 38 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 71 SDslu, 40 SDs, 0 SdLazy, 384 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital32911366 mio100 ax100 hnf100 lsp99 ukn7 mio100 lsp38 div100 bol100 ite100 ukn100 eq199 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms 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...