./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_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/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_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/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-01 17:01:37,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:01:37,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:01:37,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:01:37,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:01:37,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:01:37,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:01:37,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:01:37,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:01:37,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:01:37,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:01:37,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:01:37,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:01:37,966 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:01:37,966 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:01:37,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:01:37,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:01:37,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:01:37,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:01:37,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:01:37,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:01:37,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:01:37,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:01:37,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:01:37,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:01:37,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:01:37,973 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:01:37,973 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:01:37,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:01:37,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:01:37,974 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:01:37,975 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:01:37,975 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:01:37,975 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:01:37,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:01:37,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:01:37,976 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 17:01:37,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:01:37,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:01:37,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:01:37,984 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:01:37,985 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 17:01:37,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:01:37,985 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 17:01:37,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:01:37,986 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 17:01:37,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:01:37,987 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 17:01:37,987 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 17:01:37,987 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 17:01:37,987 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_3482e1a0-516b-468c-be1c-18a6fb6693ec/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-01 17:01:38,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:01:38,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:01:38,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:01:38,014 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:01:38,014 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:01:38,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-12-01 17:01:38,049 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/data/de6aeca43/14736f91890f4121b0ae62300005728c/FLAG6233877f6 [2018-12-01 17:01:38,451 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:01:38,451 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-12-01 17:01:38,457 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/data/de6aeca43/14736f91890f4121b0ae62300005728c/FLAG6233877f6 [2018-12-01 17:01:38,807 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/bin-2019/uautomizer/data/de6aeca43/14736f91890f4121b0ae62300005728c [2018-12-01 17:01:38,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:01:38,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:01:38,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:01:38,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:01:38,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:01:38,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:01:38" (1/1) ... [2018-12-01 17:01:38,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76134a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:38, skipping insertion in model container [2018-12-01 17:01:38,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:01:38" (1/1) ... [2018-12-01 17:01:38,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:01:38,861 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:01:39,001 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:01:39,007 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:01:39,062 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:01:39,081 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:01:39,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39 WrapperNode [2018-12-01 17:01:39,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:01:39,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:01:39,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:01:39,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:01:39,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:01:39,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:01:39,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:01:39,107 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:01:39,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... [2018-12-01 17:01:39,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:01:39,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:01:39,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:01:39,121 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:01:39,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/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-01 17:01:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:01:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 17:01:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 17:01:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 17:01:39,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:01:39,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:01:39,282 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:01:39,282 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 17:01:39,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:39 BoogieIcfgContainer [2018-12-01 17:01:39,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:01:39,283 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 17:01:39,283 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 17:01:39,285 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 17:01:39,286 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:01:39,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 05:01:38" (1/3) ... [2018-12-01 17:01:39,286 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fb03835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 05:01:39, skipping insertion in model container [2018-12-01 17:01:39,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:01:39,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:01:39" (2/3) ... [2018-12-01 17:01:39,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fb03835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 05:01:39, skipping insertion in model container [2018-12-01 17:01:39,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:01:39,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:39" (3/3) ... [2018-12-01 17:01:39,288 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-12-01 17:01:39,320 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:01:39,321 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 17:01:39,321 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 17:01:39,321 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 17:01:39,321 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:01:39,321 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:01:39,321 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 17:01:39,321 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:01:39,321 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 17:01:39,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-12-01 17:01:39,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:01:39,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:01:39,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:01:39,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 17:01:39,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 17:01:39,345 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 17:01:39,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-12-01 17:01:39,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:01:39,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:01:39,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:01:39,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 17:01:39,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 17:01:39,351 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-01 17:01:39,351 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-01 17:01:39,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-01 17:01:39,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:39,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:39,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:01:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:39,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 1 times [2018-12-01 17:01:39,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:39,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:01:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:39,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:39,490 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-01 17:01:39,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:39,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:39,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:39,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:01:39,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:40,736 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 171 DAG size of output: 147 [2018-12-01 17:01:41,197 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-12-01 17:01:41,205 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:01:41,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:01:41,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:01:41,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:01:41,207 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:01:41,207 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:01:41,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:01:41,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:01:41,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-01 17:01:41,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:01:41,207 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:01:41,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:41,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:41,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:41,233 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-01 17:01:41,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:41,236 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-01 17:01:41,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:42,265 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 119 [2018-12-01 17:01:42,418 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-01 17:01:42,419 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-01 17:01:42,420 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-01 17:01:42,421 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-01 17:01:42,422 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-01 17:01:42,423 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-01 17:01:42,424 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-01 17:01:42,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:42,426 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-01 17:01:42,427 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-01 17:01:42,428 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-01 17:01:42,429 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-01 17:01:42,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:42,665 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-12-01 17:01:42,987 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:01:42,991 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:01:42,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-01 17:01:42,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:42,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:01:42,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:42,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:42,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:42,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:01:42,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:01:42,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:42,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:42,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:42,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:01:42,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:42,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:42,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:42,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:01:42,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:01:42,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:42,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:42,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:42,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:01:43,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:01:43,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:01:43,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,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-01 17:01:43,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,025 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:01:43,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,027 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:01:43,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:01:43,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:01:43,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:01:43,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,043 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:01:43,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,044 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:01:43,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,050 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:01:43,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,050 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:01:43,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:43,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:01:43,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:01:43,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:01:43,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:43,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:43,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,063 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:01:43,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,064 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:01:43,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:43,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,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-01 17:01:43,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,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-01 17:01:43,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:01:43,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:01:43,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:01:43,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,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-01 17:01:43,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:43,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:43,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:43,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,086 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:01:43,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,086 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:01:43,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:43,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:43,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-01 17:01:43,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:43,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:01:43,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:43,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:43,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:43,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:01:43,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:01:43,093 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:01:43,095 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 17:01:43,096 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 17:01:43,097 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:01:43,097 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 17:01:43,097 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:01:43,097 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-01 17:01:43,543 INFO L297 tatePredicateManager]: 111 out of 116 supporting invariants were superfluous and have been removed [2018-12-01 17:01:43,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:01:43,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:01:43,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:43,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:43,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:43,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:43,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:43,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:43,661 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-01 17:01:43,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:43,667 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-01 17:01:43,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:43,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:43,701 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-01 17:01:43,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 17:01:43,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:01:43,752 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-01 17:01:43,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2018-12-01 17:01:43,815 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-01 17:01:43,824 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-01 17:01:43,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2018-12-01 17:01:43,900 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-01 17:01:43,901 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-01 17:01:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 17:01:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-01 17:01:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 2 letters. Loop has 3 letters. [2018-12-01 17:01:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:01:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-01 17:01:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:01:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-01 17:01:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:01:43,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2018-12-01 17:01:43,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:01:43,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 14 transitions. [2018-12-01 17:01:43,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-01 17:01:43,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-01 17:01:43,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-01 17:01:43,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:01:43,908 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-01 17:01:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-01 17:01:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-01 17:01:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-01 17:01:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-01 17:01:43,924 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-01 17:01:43,924 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-01 17:01:43,924 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 17:01:43,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-01 17:01:43,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:01:43,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:01:43,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:01:43,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 17:01:43,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 17:01:43,925 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~mem18;havoc main_#t~mem17; 548#L560-2 [2018-12-01 17:01:43,925 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-01 17:01:43,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:43,925 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-12-01 17:01:43,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:43,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:43,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:01:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:43,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 2 times [2018-12-01 17:01:43,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:43,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:43,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:01:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:43,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2018-12-01 17:01:43,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:43,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:43,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:01:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:45,548 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 203 DAG size of output: 173 [2018-12-01 17:01:46,250 WARN L180 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-01 17:01:46,254 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:01:46,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:01:46,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:01:46,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:01:46,254 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:01:46,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:01:46,254 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:01:46,254 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:01:46,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-01 17:01:46,254 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:01:46,254 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:01:46,257 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-01 17:01:46,259 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-01 17:01:46,262 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-01 17:01:46,264 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-01 17:01:46,265 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-01 17:01:47,487 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 129 [2018-12-01 17:01:47,652 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-01 17:01:47,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,660 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-01 17:01:47,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,664 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-01 17:01:47,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,666 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-01 17:01:47,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:47,921 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-12-01 17:01:48,200 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:01:48,200 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:01:48,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:01:48,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:01:48,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:01:48,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:48,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:01:48,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,215 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:01:48,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,216 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:01:48,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:01:48,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:01:48,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:01:48,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:01:48,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:01:48,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:01:48,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:01:48,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:01:48,237 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:01:48,241 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:01:48,241 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 17:01:48,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:01:48,242 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-01 17:01:48,243 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:01:48,243 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-01 17:01:48,694 INFO L297 tatePredicateManager]: 111 out of 117 supporting invariants were superfluous and have been removed [2018-12-01 17:01:48,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:01:48,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:01:48,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:01:48,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:48,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:48,742 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-01 17:01:48,747 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-01 17:01:48,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,762 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-01 17:01:48,768 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-01 17:01:48,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,792 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-01 17:01:48,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:48,836 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-01 17:01:48,837 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:48,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:48,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:48,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:48,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:48,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:01:48,921 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-01 17:01:48,921 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:35 [2018-12-01 17:01:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:01:48,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:01:48,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:49,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:49,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:49,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, 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-01 17:01:49,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:49,086 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-01 17:01:49,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-12-01 17:01:49,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:49,553 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-01 17:01:49,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 17:01:49,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:49,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:01:49,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:49,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:50,005 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-01 17:01:50,007 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:01:50,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:50,398 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-01 17:01:50,400 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:01:51,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:01:51,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2018-12-01 17:01:51,030 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-12-01 17:01:51,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-01 17:01:51,715 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-01 17:01:51,715 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:83, output treesize:670 [2018-12-01 17:01:52,621 WARN L180 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-12-01 17:01:52,622 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-01 17:01:52,622 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-01 17:01:52,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-12-01 17:01:52,686 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-01 17:01:52,687 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-01 17:01:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 17:01:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-01 17:01:52,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-01 17:01:52,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:01:52,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-01 17:01:52,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:01:52,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-01 17:01:52,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:01:52,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-01 17:01:52,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:01:52,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-12-01 17:01:52,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 17:01:52,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 17:01:52,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-12-01 17:01:52,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:01:52,689 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-01 17:01:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-12-01 17:01:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-01 17:01:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-01 17:01:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-12-01 17:01:52,691 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-01 17:01:52,691 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-01 17:01:52,691 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 17:01:52,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-12-01 17:01:52,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:01:52,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:01:52,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:01:52,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1] [2018-12-01 17:01:52,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 17:01:52,691 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 1104#L560-2 [2018-12-01 17:01:52,692 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-01 17:01:52,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash 179493187, now seen corresponding path program 2 times [2018-12-01 17:01:52,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:52,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:52,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:52,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:01:52,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:52,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:52,728 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 3 times [2018-12-01 17:01:52,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:52,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:52,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:01:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:52,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:01:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash 47257513, now seen corresponding path program 2 times [2018-12-01 17:01:52,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:01:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:01:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:52,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:01:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:01:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:01:57,651 WARN L180 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 234 DAG size of output: 202 [2018-12-01 17:01:59,642 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 173 [2018-12-01 17:01:59,645 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:01:59,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:01:59,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:01:59,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:01:59,645 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:01:59,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:01:59,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:01:59,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:01:59,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-01 17:01:59,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:01:59,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:01:59,648 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-01 17:01:59,650 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-01 17:01:59,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,660 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-01 17:01:59,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:01:59,664 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-01 17:01:59,664 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-01 17:01:59,666 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-01 17:02:01,570 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 130 [2018-12-01 17:02:01,723 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-01 17:02:01,724 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-01 17:02:01,725 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-01 17:02:01,725 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-01 17:02:01,886 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-12-01 17:02:02,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:02:02,199 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:02:02,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:02:02,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:02:02,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:02:02,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,220 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:02:02,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,220 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:02:02,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,223 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:02:02,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,223 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:02:02,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,254 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:02:02,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,255 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:02:02,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:02:02,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,259 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:02:02,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,260 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:02:02,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,266 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:02:02,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,267 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:02:02,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:02:02,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:02:02,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:02:02,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:02:02,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:02:02,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:02:02,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:02:02,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:02:02,275 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:02:02,279 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:02:02,279 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 17:02:02,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:02:02,280 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-01 17:02:02,280 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:02:02,280 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-01 17:02:02,757 INFO L297 tatePredicateManager]: 111 out of 117 supporting invariants were superfluous and have been removed [2018-12-01 17:02:02,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:02:02,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:02:02,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:02:02,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:02:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:02:02,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:02:02,895 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-01 17:02:02,902 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-01 17:02:02,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:02,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:02,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:02,929 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-01 17:02:02,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:02,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:02,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:02,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:02,983 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-01 17:02:03,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,046 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-01 17:02:03,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,117 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-01 17:02:03,118 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:03,182 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:03,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:03,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:03,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:03,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:03,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:03,418 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-01 17:02:04,131 WARN L180 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-01 17:02:04,136 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-01 17:02:04,136 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:04,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:02:04,140 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:04,141 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 17:02:04,141 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:04,289 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-01 17:02:04,290 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:04,417 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-01 17:02:04,425 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 17:02:04,425 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:07,493 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-01 17:02:07,493 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:09,428 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-01 17:02:09,429 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-01 17:02:11,538 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-01 17:02:11,539 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-01 17:02:14,001 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-01 17:02:14,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-01 17:02:14,005 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:14,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:14,048 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-01 17:02:14,051 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-01 17:02:14,051 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:14,069 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:14,077 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-01 17:02:15,689 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:02:15,710 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-01 17:02:15,713 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-01 17:02:15,713 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:15,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:15,744 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:02:15,759 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-01 17:02:15,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-01 17:02:15,761 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:15,787 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:15,795 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-01 17:02:16,790 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-01 17:02:16,793 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-01 17:02:16,793 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:16,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:16,826 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-01 17:02:16,829 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-01 17:02:16,829 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:16,847 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:16,854 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-01 17:02:16,866 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-01 17:02:16,869 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-01 17:02:16,869 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:16,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:16,895 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-01 17:02:16,898 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-01 17:02:16,898 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:16,910 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:16,917 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-01 17:02:17,535 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-01 17:02:17,538 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-01 17:02:17,539 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:17,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:17,590 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-01 17:02:17,593 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-01 17:02:17,593 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:17,617 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:17,623 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-01 17:02:18,047 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-01 17:02:18,050 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-01 17:02:18,050 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:18,096 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-01 17:02:18,099 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-01 17:02:18,099 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,122 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,129 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-01 17:02:18,254 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-01 17:02:18,257 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-01 17:02:18,257 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:18,299 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-01 17:02:18,302 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-01 17:02:18,302 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,324 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,331 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-01 17:02:18,389 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-01 17:02:18,393 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-01 17:02:18,393 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:18,418 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-01 17:02:18,420 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-01 17:02:18,421 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,433 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,440 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-01 17:02:18,493 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-01 17:02:18,607 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-01 17:02:18,612 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-01 17:02:18,612 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,730 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-01 17:02:18,731 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 4 xjuncts. [2018-12-01 17:02:18,872 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-01 17:02:18,875 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-01 17:02:18,876 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:18,912 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-01 17:02:18,915 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-01 17:02:18,915 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,934 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:18,942 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-01 17:02:19,037 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-01 17:02:19,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 12 treesize of output 11 [2018-12-01 17:02:19,040 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,077 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-01 17:02:19,080 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-01 17:02:19,080 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,099 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,107 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-01 17:02:19,165 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-01 17:02:19,167 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-01 17:02:19,167 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,195 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-01 17:02:19,198 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-01 17:02:19,198 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,216 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,223 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-01 17:02:19,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, 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-01 17:02:19,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-01 17:02:19,237 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,272 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-01 17:02:19,275 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-01 17:02:19,275 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,287 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,294 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-01 17:02:19,316 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-01 17:02:19,376 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-01 17:02:19,422 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-01 17:02:19,422 INFO L202 ElimStorePlain]: Needed 68 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-01 17:02:19,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,527 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-01 17:02:19,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,530 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-01 17:02:19,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,574 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-01 17:02:19,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-01 17:02:19,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,711 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-01 17:02:19,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:19,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-12-01 17:02:19,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,767 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-01 17:02:19,772 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-01 17:02:19,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:19,863 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-01 17:02:19,864 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:02:19,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:02:19,912 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-01 17:02:19,957 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-01 17:02:19,957 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-01 17:02:20,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,100 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-01 17:02:20,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,103 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-01 17:02:20,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:20,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:20,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,276 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-01 17:02:20,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,280 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-01 17:02:20,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:20,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:20,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,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, 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-01 17:02:20,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,424 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-01 17:02:20,425 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:20,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:20,539 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-01 17:02:20,539 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:351, output treesize:300 [2018-12-01 17:02:20,672 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-01 17:02:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:02:20,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:02:20,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,739 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-01 17:02:20,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:20,772 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-01 17:02:20,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-12-01 17:02:21,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:21,824 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-01 17:02:21,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:22,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:22,659 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-01 17:02:22,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-12-01 17:02:23,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:23,611 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-01 17:02:23,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:02:23,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:23,857 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-01 17:02:23,858 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-01 17:02:24,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:24,032 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-01 17:02:24,033 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:24,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-01 17:02:24,220 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-01 17:02:24,220 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-01 17:02:24,861 WARN L180 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-01 17:02:24,863 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-01 17:02:24,863 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-01 17:02:24,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-01 17:02:24,988 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-01 17:02:24,988 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-01 17:02:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 17:02:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-01 17:02:24,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-01 17:02:24,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:02:24,989 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:02:25,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:02:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:02:25,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:02:25,120 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-01 17:02:25,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 68 treesize of output 61 [2018-12-01 17:02:25,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,151 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-01 17:02:25,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,193 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-01 17:02:25,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,250 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-01 17:02:25,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,324 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-01 17:02:25,325 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:25,384 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:25,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:25,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:25,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:25,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:25,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:25,704 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-01 17:02:26,544 WARN L180 SmtUtils]: Spent 838.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-01 17:02:26,546 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 17:02:26,546 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:26,551 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-01 17:02:26,551 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:26,555 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-01 17:02:26,555 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:26,716 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-01 17:02:26,717 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:26,839 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-01 17:02:26,845 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-01 17:02:26,845 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:30,204 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-01 17:02:30,204 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-01 17:02:34,631 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-01 17:02:34,632 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-01 17:02:37,043 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-01 17:02:37,046 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-01 17:02:37,046 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:37,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:37,079 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-01 17:02:37,081 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-01 17:02:37,081 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:37,100 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:37,106 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-01 17:02:37,117 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-01 17:02:37,119 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-01 17:02:37,119 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:37,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:37,145 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-01 17:02:37,148 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-01 17:02:37,148 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:37,161 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:37,167 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-01 17:02:38,360 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-01 17:02:38,363 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-01 17:02:38,363 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:38,395 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-01 17:02:38,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-01 17:02:38,398 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,415 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,423 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-01 17:02:38,434 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-01 17:02:38,437 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-01 17:02:38,437 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:38,465 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-01 17:02:38,467 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-01 17:02:38,467 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,481 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,489 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-01 17:02:38,862 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-01 17:02:38,864 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-01 17:02:38,864 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:38,909 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-01 17:02:38,912 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-01 17:02:38,912 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,935 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:38,943 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-01 17:02:39,178 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-01 17:02:39,323 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-01 17:02:39,342 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-01 17:02:39,343 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-01 17:02:44,049 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-01 17:02:44,049 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-12-01 17:02:47,630 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-01 17:02:47,630 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:51,272 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-01 17:02:51,275 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-01 17:02:51,275 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:51,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:51,307 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-01 17:02:51,309 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-01 17:02:51,309 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:51,330 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:51,336 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-01 17:02:53,420 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-01 17:02:53,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 17:02:53,423 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:53,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:53,457 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-01 17:02:53,459 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-01 17:02:53,459 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:53,477 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:53,484 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-01 17:02:53,501 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-01 17:02:53,503 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-01 17:02:53,503 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:53,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:53,538 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-01 17:02:53,540 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-01 17:02:53,541 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:53,557 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:53,564 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-01 17:02:54,831 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:02:54,849 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-01 17:02:54,851 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-01 17:02:54,851 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:54,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:54,881 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:02:54,896 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-01 17:02:54,898 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-01 17:02:54,898 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:54,921 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:54,929 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-01 17:02:55,803 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-01 17:02:55,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-01 17:02:55,806 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:55,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:55,842 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-01 17:02:55,845 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-01 17:02:55,845 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:55,862 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:55,869 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-01 17:02:56,400 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-01 17:02:56,403 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-01 17:02:56,403 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:56,446 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-01 17:02:56,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-01 17:02:56,449 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,470 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,475 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-01 17:02:56,799 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-01 17:02:56,802 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-01 17:02:56,802 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:56,827 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-01 17:02:56,829 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-01 17:02:56,829 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,841 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,848 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-01 17:02:56,859 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-01 17:02:56,862 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-01 17:02:56,862 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:56,888 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-01 17:02:56,890 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-01 17:02:56,890 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,902 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:56,908 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-01 17:02:56,949 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-01 17:02:57,017 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-01 17:02:57,063 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-01 17:02:57,063 INFO L202 ElimStorePlain]: Needed 72 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-01 17:02:57,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,152 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-01 17:02:57,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,157 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-01 17:02:57,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:57,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:57,191 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-01 17:02:57,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-01 17:02:57,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,321 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-01 17:02:57,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,325 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-01 17:02:57,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:57,377 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-01 17:02:57,381 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-01 17:02:57,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:57,467 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-01 17:02:57,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:02:57,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:02:57,517 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-01 17:02:57,558 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-01 17:02:57,558 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-01 17:02:57,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,698 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-01 17:02:57,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 17:02:57,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:57,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:57,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,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 110 treesize of output 129 [2018-12-01 17:02:57,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:57,871 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-01 17:02:57,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:57,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:58,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,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, 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-01 17:02:58,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,030 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-01 17:02:58,030 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:58,057 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:02:58,145 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-01 17:02:58,145 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:351, output treesize:300 [2018-12-01 17:02:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:02:58,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:02:58,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,340 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-01 17:02:58,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,349 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-01 17:02:58,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:58,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,633 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-01 17:02:58,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 17:02:58,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,837 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-01 17:02:58,837 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:02:58,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:58,996 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-01 17:02:58,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:02:59,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:59,130 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-01 17:02:59,131 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-01 17:02:59,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:59,240 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-01 17:02:59,242 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 9 xjuncts. [2018-12-01 17:02:59,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-01 17:02:59,446 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-01 17:02:59,446 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-01 17:02:59,765 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-01 17:02:59,765 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-01 17:02:59,766 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-01 17:02:59,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-01 17:02:59,822 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-01 17:02:59,822 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-01 17:02:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 17:02:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-01 17:02:59,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-01 17:02:59,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:02:59,823 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:02:59,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:02:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:02:59,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:02:59,932 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-01 17:02:59,939 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-01 17:02:59,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:59,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:59,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:59,967 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-01 17:02:59,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:02:59,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,004 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-01 17:03:00,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,051 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-01 17:03:00,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,106 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-01 17:03:00,107 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:00,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:00,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:00,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:00,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:00,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:00,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:00,403 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-01 17:03:01,099 WARN L180 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-01 17:03:01,102 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-01 17:03:01,102 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:01,103 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 17:03:01,103 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:01,105 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-01 17:03:01,105 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:01,233 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-01 17:03:01,233 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:01,351 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-01 17:03:01,379 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-01 17:03:01,380 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-12-01 17:03:06,559 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-01 17:03:06,559 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:09,769 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-01 17:03:09,770 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:13,257 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-01 17:03:13,259 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-01 17:03:13,259 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:13,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:13,295 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-01 17:03:13,297 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-01 17:03:13,297 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:13,315 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:13,321 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-01 17:03:15,646 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-01 17:03:15,648 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-01 17:03:15,648 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:15,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:15,683 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-01 17:03:15,685 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-01 17:03:15,685 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:15,702 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:15,709 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-01 17:03:15,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, 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-01 17:03:15,730 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-01 17:03:15,730 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:15,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:15,767 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-01 17:03:15,769 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-01 17:03:15,769 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:15,788 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:15,795 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-01 17:03:16,853 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-01 17:03:16,856 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-01 17:03:16,856 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:16,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:16,900 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-01 17:03:16,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01 17:03:16,903 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:16,926 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:16,933 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-01 17:03:17,484 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-01 17:03:17,486 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-01 17:03:17,486 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:17,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:17,527 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-01 17:03:17,531 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-01 17:03:17,531 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:17,556 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:17,562 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-01 17:03:17,792 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-01 17:03:17,795 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-01 17:03:17,795 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:17,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:17,833 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-01 17:03:17,836 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-01 17:03:17,836 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:17,856 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:17,863 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-01 17:03:18,024 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-01 17:03:18,027 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-01 17:03:18,027 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:18,076 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-01 17:03:18,079 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-01 17:03:18,079 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,102 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,107 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-01 17:03:18,243 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-01 17:03:18,246 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-01 17:03:18,246 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:18,270 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-01 17:03:18,273 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-01 17:03:18,273 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,285 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,292 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-01 17:03:18,304 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-01 17:03:18,306 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-01 17:03:18,306 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:18,332 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-01 17:03:18,334 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-01 17:03:18,334 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,346 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:18,353 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-01 17:03:18,430 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-01 17:03:18,547 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-01 17:03:18,553 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-01 17:03:18,553 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:22,945 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-01 17:03:22,945 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:25,991 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-01 17:03:25,992 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-12-01 17:03:29,471 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-01 17:03:29,472 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 4 xjuncts. [2018-12-01 17:03:33,667 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-01 17:03:33,670 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-01 17:03:33,670 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:33,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:33,712 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-01 17:03:33,715 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-01 17:03:33,715 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:33,738 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:33,745 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-01 17:03:36,244 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-01 17:03:36,246 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-01 17:03:36,246 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:36,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:36,289 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-01 17:03:36,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-01 17:03:36,291 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:36,315 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:36,321 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-01 17:03:37,796 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-01 17:03:37,799 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-01 17:03:37,799 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:37,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:37,840 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-01 17:03:37,842 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-01 17:03:37,842 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:37,865 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:37,871 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-01 17:03:38,705 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-01 17:03:38,707 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-01 17:03:38,708 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:38,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:38,733 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-01 17:03:38,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 8 treesize of output 7 [2018-12-01 17:03:38,735 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:38,747 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:38,753 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-01 17:03:39,310 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-01 17:03:39,312 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-01 17:03:39,312 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:39,339 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-01 17:03:39,341 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-01 17:03:39,341 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,354 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,361 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-01 17:03:39,373 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-01 17:03:39,375 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-01 17:03:39,375 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:39,401 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-01 17:03:39,403 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-01 17:03:39,404 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,415 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,422 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-01 17:03:39,433 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-01 17:03:39,435 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-01 17:03:39,436 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:39,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, 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-01 17:03:39,461 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-01 17:03:39,461 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,473 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,479 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-01 17:03:39,761 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-01 17:03:39,764 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-01 17:03:39,764 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:39,791 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-01 17:03:39,793 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-01 17:03:39,793 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,806 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:39,812 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-01 17:03:39,860 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-01 17:03:39,914 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-01 17:03:39,969 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-01 17:03:39,970 INFO L202 ElimStorePlain]: Needed 89 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-01 17:03:40,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,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 47 treesize of output 90 [2018-12-01 17:03:40,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,083 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-01 17:03:40,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:40,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:40,124 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-01 17:03:40,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-01 17:03:40,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,295 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-01 17:03:40,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,299 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-01 17:03:40,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:40,372 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-01 17:03:40,376 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-01 17:03:40,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:40,469 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-01 17:03:40,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:03:40,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:03:40,523 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-01 17:03:40,573 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-01 17:03:40,573 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-01 17:03:40,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,708 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-01 17:03:40,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,711 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-01 17:03:40,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:40,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:40,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,859 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-01 17:03:40,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:40,863 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-01 17:03:40,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:40,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:40,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:41,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:41,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, 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-01 17:03:41,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:41,014 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-01 17:03:41,014 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:41,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:03:41,124 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-01 17:03:41,124 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:351, output treesize:300 [2018-12-01 17:03:41,261 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-01 17:03:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:03:41,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:03:41,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:41,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:41,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:41,327 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-01 17:03:41,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:41,361 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-01 17:03:41,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-01 17:03:41,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:41,815 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-01 17:03:41,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 17:03:42,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:42,567 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-01 17:03:42,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:43,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:43,170 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-01 17:03:43,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:03:43,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:43,391 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-01 17:03:43,391 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:03:43,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:03:43,620 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-01 17:03:43,622 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 9 xjuncts. [2018-12-01 17:03:43,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-01 17:03:43,829 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-01 17:03:43,829 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-01 17:03:44,813 WARN L180 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-01 17:03:44,814 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-01 17:03:44,815 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-01 17:03:44,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-12-01 17:03:45,267 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-01 17:03:45,268 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-01 17:03:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-01 17:03:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-12-01 17:03:45,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-01 17:03:45,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:03:45,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-01 17:03:45,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:03:45,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-01 17:03:45,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:03:45,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-12-01 17:03:45,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 17:03:45,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-12-01 17:03:45,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-01 17:03:45,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-01 17:03:45,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-12-01 17:03:45,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:03:45,273 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-12-01 17:03:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-12-01 17:03:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-01 17:03:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-01 17:03:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-12-01 17:03:45,276 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-01 17:03:45,276 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-01 17:03:45,276 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 17:03:45,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-12-01 17:03:45,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:03:45,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:03:45,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:03:45,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1] [2018-12-01 17:03:45,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 17:03:45,278 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 1845#L560-2 [2018-12-01 17:03:45,278 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-01 17:03:45,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 47257511, now seen corresponding path program 3 times [2018-12-01 17:03:45,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:45,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:03:45,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:03:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:03:45,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 4 times [2018-12-01 17:03:45,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:45,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:45,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:03:45,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:03:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:03:45,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:03:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash -900755771, now seen corresponding path program 3 times [2018-12-01 17:03:45,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:03:45,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:03:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:03:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:03:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:03:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:03:58,114 WARN L180 SmtUtils]: Spent 12.62 s on a formula simplification. DAG size of input: 265 DAG size of output: 228 [2018-12-01 17:04:03,580 WARN L180 SmtUtils]: Spent 5.46 s on a formula simplification that was a NOOP. DAG size: 185 [2018-12-01 17:04:03,584 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:04:03,584 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:04:03,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:04:03,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:04:03,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:04:03,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:04:03,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:04:03,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:04:03,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-01 17:04:03,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:04:03,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:04:03,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:03,588 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-01 17:04:03,590 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-01 17:04:03,590 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-01 17:04:03,591 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-01 17:04:03,593 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-01 17:04:03,593 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-01 17:04:03,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:03,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:03,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:03,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:03,598 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-01 17:04:08,863 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 128 [2018-12-01 17:04:09,025 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2018-12-01 17:04:09,026 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-01 17:04:09,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:09,028 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-01 17:04:09,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:09,030 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-01 17:04:09,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:09,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:04:09,033 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-01 17:04:09,276 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-12-01 17:04:09,570 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:04:09,570 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:04:09,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:04:09,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:04:09,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:04:09,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:04:09,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:04:09,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:04:09,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:04:09,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:04:09,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:04:09,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:04:09,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:04:09,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:04:09,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:04:09,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:04:09,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:04:09,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:04:09,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:04:09,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:04:09,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:04:09,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:04:09,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:04:09,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:04:09,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:04:09,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:04:09,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:04:09,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:04:09,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,586 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:04:09,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,586 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:04:09,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:04:09,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:04:09,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:04:09,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,608 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:04:09,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,609 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:04:09,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,611 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:04:09,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,611 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:04:09,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:04:09,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:04:09,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:04:09,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:04:09,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:04:09,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:04:09,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:04:09,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:04:09,623 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:04:09,628 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:04:09,628 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 17:04:09,628 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:04:09,629 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-01 17:04:09,629 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:04:09,629 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-01 17:04:10,128 INFO L297 tatePredicateManager]: 104 out of 110 supporting invariants were superfluous and have been removed [2018-12-01 17:04:10,134 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:04:10,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:04:10,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:04:10,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:04:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:04:10,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:04:10,261 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-01 17:04:10,267 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-01 17:04:10,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,289 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-01 17:04:10,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,333 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-01 17:04:10,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,394 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-01 17:04:10,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,456 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-01 17:04:10,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:10,498 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:10,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:10,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:10,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:10,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:10,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:10,743 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-01 17:04:11,510 WARN L180 SmtUtils]: Spent 764.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-01 17:04:11,514 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-01 17:04:11,515 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:11,519 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-01 17:04:11,519 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:11,519 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 17:04:11,520 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:11,654 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-01 17:04:11,654 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:11,772 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-01 17:04:11,785 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-01 17:04:11,785 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-01 17:04:15,637 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-01 17:04:15,637 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:17,510 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-01 17:04:17,510 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-01 17:04:21,770 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-01 17:04:21,772 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-01 17:04:21,772 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:21,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:21,815 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-01 17:04:21,817 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-01 17:04:21,817 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:21,841 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:21,849 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-01 17:04:23,070 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-01 17:04:23,073 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-01 17:04:23,073 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:23,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:23,110 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-01 17:04:23,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01 17:04:23,113 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:23,131 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:23,138 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-01 17:04:23,791 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-01 17:04:23,794 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-01 17:04:23,794 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:23,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:23,851 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-01 17:04:23,854 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-01 17:04:23,854 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:23,878 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:23,884 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-01 17:04:24,167 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-01 17:04:24,169 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-01 17:04:24,170 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:24,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-01 17:04:24,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-01 17:04:24,196 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,208 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,215 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-01 17:04:24,524 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-01 17:04:24,527 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-01 17:04:24,527 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:24,551 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-01 17:04:24,553 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-01 17:04:24,553 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,565 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,572 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-01 17:04:24,662 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-01 17:04:24,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 12 treesize of output 11 [2018-12-01 17:04:24,665 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:24,710 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-01 17:04:24,712 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-01 17:04:24,712 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,735 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:24,742 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-01 17:04:24,814 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-01 17:04:24,941 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-01 17:04:24,946 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-01 17:04:24,946 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:28,500 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-01 17:04:28,500 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-12-01 17:04:30,949 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-01 17:04:30,950 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 4 xjuncts. [2018-12-01 17:04:33,966 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 76 treesize of output 100 [2018-12-01 17:04:33,969 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-01 17:04:33,969 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:33,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:34,004 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 56 treesize of output 113 [2018-12-01 17:04:34,007 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-01 17:04:34,007 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:34,026 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:34,035 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-01 17:04:34,049 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 92 [2018-12-01 17:04:34,052 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-01 17:04:34,052 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:34,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:34,087 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-01 17:04:34,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 17:04:34,090 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:34,108 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:34,116 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-01 17:04:36,305 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-01 17:04:36,307 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-01 17:04:36,307 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:36,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:36,344 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-01 17:04:36,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 8 treesize of output 7 [2018-12-01 17:04:36,348 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:36,377 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:36,384 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-01 17:04:37,649 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-01 17:04:37,652 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-01 17:04:37,652 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:37,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:37,699 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-01 17:04:37,702 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-01 17:04:37,702 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:37,726 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:37,732 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-01 17:04:38,353 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-01 17:04:38,355 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-01 17:04:38,356 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:38,388 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-01 17:04:38,391 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-01 17:04:38,391 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,410 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,417 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-01 17:04:38,776 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-01 17:04:38,779 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-01 17:04:38,779 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:38,805 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-01 17:04:38,808 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-01 17:04:38,808 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,820 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,827 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-01 17:04:38,838 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-01 17:04:38,841 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-01 17:04:38,841 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:38,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, 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-01 17:04:38,870 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-01 17:04:38,870 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,883 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:38,890 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-01 17:04:39,011 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-01 17:04:39,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-01 17:04:39,014 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:39,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:39,059 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-01 17:04:39,062 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-01 17:04:39,062 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:39,084 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:39,090 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-01 17:04:39,225 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-01 17:04:39,292 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-01 17:04:39,340 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-01 17:04:39,340 INFO L202 ElimStorePlain]: Needed 76 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-01 17:04:39,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:39,428 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-01 17:04:39,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:39,431 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-01 17:04:39,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:39,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:39,467 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-01 17:04:39,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-01 17:04:39,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:39,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:39,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:39,622 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-01 17:04:39,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:39,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-12-01 17:04:39,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:39,680 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-01 17:04:39,683 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-01 17:04:39,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:39,774 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-01 17:04:39,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:04:39,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:04:39,820 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-01 17:04:39,864 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-01 17:04:39,864 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-01 17:04:39,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:39,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:40,001 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-01 17:04:40,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:40,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:04:40,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:40,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:40,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:40,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:40,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 107 treesize of output 126 [2018-12-01 17:04:40,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:40,163 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-01 17:04:40,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:40,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:40,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:40,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:40,288 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-01 17:04:40,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:40,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 28 treesize of output 7 [2018-12-01 17:04:40,292 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:40,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:40,396 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-01 17:04:40,396 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:330, output treesize:279 [2018-12-01 17:04:40,520 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-01 17:04:41,127 WARN L180 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-01 17:04:41,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,148 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-01 17:04:41,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,155 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-01 17:04:41,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,209 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-01 17:04:41,213 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-01 17:04:41,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,246 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-01 17:04:41,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,429 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-01 17:04:41,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,432 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-01 17:04:41,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,484 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-01 17:04:41,487 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-01 17:04:41,487 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,500 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,520 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-01 17:04:41,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,653 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-01 17:04:41,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,657 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-01 17:04:41,657 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:41,731 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-01 17:04:41,734 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-01 17:04:41,734 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,752 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:41,777 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-01 17:04:41,868 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-01 17:04:41,868 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:471, output treesize:280 [2018-12-01 17:04:42,008 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-01 17:04:42,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,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, 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-01 17:04:42,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,030 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-01 17:04:42,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:42,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:42,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,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, 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-01 17:04:42,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,197 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-01 17:04:42,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:42,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:42,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,349 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-01 17:04:42,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,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, 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-01 17:04:42,353 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:42,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:42,478 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-01 17:04:42,478 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:353, output treesize:302 [2018-12-01 17:04:42,924 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-01 17:04:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:04:42,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:04:42,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:42,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, 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-01 17:04:42,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:43,005 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-01 17:04:43,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-01 17:04:43,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:43,406 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-01 17:04:43,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:43,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:43,684 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-01 17:04:43,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-12-01 17:04:44,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:44,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-01 17:04:44,250 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:04:44,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:44,442 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-01 17:04:44,444 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-12-01 17:04:44,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:44,624 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-01 17:04:44,624 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:44,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-01 17:04:44,805 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-01 17:04:44,805 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-01 17:04:45,105 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-01 17:04:45,105 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-01 17:04:45,105 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-01 17:04:45,105 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-01 17:04:45,184 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-01 17:04:45,184 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-01 17:04:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 17:04:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-01 17:04:45,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-01 17:04:45,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:04:45,185 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:04:45,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:04:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:04:45,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:04:45,299 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-01 17:04:45,304 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-01 17:04:45,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,325 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-01 17:04:45,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,366 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-01 17:04:45,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,420 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-01 17:04:45,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,476 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-01 17:04:45,476 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:45,511 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:45,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:45,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:45,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:45,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:04:45,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:04:45,740 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-01 17:04:46,262 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-01 17:04:46,265 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-01 17:04:46,265 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:46,266 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 17:04:46,266 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:46,269 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-01 17:04:46,269 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:46,401 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-01 17:04:46,401 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:46,516 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-01 17:04:46,543 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-01 17:04:46,544 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-12-01 17:04:54,023 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-01 17:04:54,023 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 17:04:58,645 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-01 17:04:58,646 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-12-01 17:05:04,253 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-01 17:05:04,254 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-01 17:05:10,368 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-01 17:05:10,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 12 treesize of output 11 [2018-12-01 17:05:10,371 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:10,400 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-01 17:05:10,403 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-01 17:05:10,403 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,416 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,424 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-01 17:05:10,437 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-01 17:05:10,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 17:05:10,440 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:10,470 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-01 17:05:10,473 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-01 17:05:10,473 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,486 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,494 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-01 17:05:10,507 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-01 17:05:10,510 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-01 17:05:10,510 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:10,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 45 treesize of output 82 [2018-12-01 17:05:10,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-01 17:05:10,546 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,561 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:10,568 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-01 17:05:14,518 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:05:14,543 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-01 17:05:14,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-01 17:05:14,547 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:14,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:14,582 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:05:14,598 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-01 17:05:14,601 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-01 17:05:14,601 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:14,629 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:14,637 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-01 17:05:17,078 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-01 17:05:17,081 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-01 17:05:17,081 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:17,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:17,126 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-01 17:05:17,128 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-01 17:05:17,128 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:17,153 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:17,160 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-01 17:05:18,664 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-01 17:05:18,666 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-01 17:05:18,666 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:18,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:18,699 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-01 17:05:18,701 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-01 17:05:18,701 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:18,717 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:18,724 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-01 17:05:18,744 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-01 17:05:18,746 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-01 17:05:18,746 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:18,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:18,781 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-01 17:05:18,783 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-01 17:05:18,783 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:18,802 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:18,809 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-01 17:05:19,461 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-01 17:05:19,464 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-01 17:05:19,464 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:19,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:19,521 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-01 17:05:19,524 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-01 17:05:19,524 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:19,551 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:19,559 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-01 17:05:19,817 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-01 17:05:19,820 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-01 17:05:19,820 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:19,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:19,854 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-01 17:05:19,856 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-01 17:05:19,856 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:19,872 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:19,879 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-01 17:05:20,076 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-01 17:05:20,079 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-01 17:05:20,079 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:20,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:20,130 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-01 17:05:20,133 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-01 17:05:20,133 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:20,157 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:20,165 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-01 17:05:20,263 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-01 17:05:20,744 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-01 17:05:20,755 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-01 17:05:20,756 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-12-01 17:05:26,244 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-01 17:05:26,244 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:29,542 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-01 17:05:29,542 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 4 xjuncts. [2018-12-01 17:05:33,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:05:33,640 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-12-01 17:05:38,173 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-01 17:05:38,175 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-01 17:05:38,175 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:38,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:38,222 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-01 17:05:38,224 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-01 17:05:38,225 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:38,249 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:38,256 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-01 17:05:41,232 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-01 17:05:41,235 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-01 17:05:41,235 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:41,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:41,268 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-01 17:05:41,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 8 treesize of output 7 [2018-12-01 17:05:41,271 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:41,288 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:41,296 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-01 17:05:41,307 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-01 17:05:41,309 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-01 17:05:41,309 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:41,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:41,336 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-01 17:05:41,338 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-01 17:05:41,338 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:41,350 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:41,359 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-01 17:05:42,827 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-01 17:05:42,830 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-01 17:05:42,830 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:42,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:42,864 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-01 17:05:42,867 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-01 17:05:42,867 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:42,884 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:42,891 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-01 17:05:43,558 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-01 17:05:43,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 12 treesize of output 11 [2018-12-01 17:05:43,561 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:43,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:43,598 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-01 17:05:43,601 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-01 17:05:43,601 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:43,619 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:43,625 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-01 17:05:44,120 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-01 17:05:44,122 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-01 17:05:44,123 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,151 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-01 17:05:44,154 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-01 17:05:44,154 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,167 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,174 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-01 17:05:44,192 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-01 17:05:44,195 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-01 17:05:44,195 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,231 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-01 17:05:44,234 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-01 17:05:44,234 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,252 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,260 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-01 17:05:44,406 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-01 17:05:44,409 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-01 17:05:44,409 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,438 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-01 17:05:44,441 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-01 17:05:44,441 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,455 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,462 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-01 17:05:44,477 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-01 17:05:44,480 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-01 17:05:44,480 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,510 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-01 17:05:44,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 8 treesize of output 7 [2018-12-01 17:05:44,514 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,528 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,536 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-01 17:05:44,582 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-01 17:05:44,614 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-01 17:05:44,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-01 17:05:44,661 INFO L202 ElimStorePlain]: Needed 98 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-01 17:05:44,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,755 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-01 17:05:44,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,759 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-01 17:05:44,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,794 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-01 17:05:44,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-01 17:05:44,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,939 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-01 17:05:44,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:44,943 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-01 17:05:44,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:44,996 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-01 17:05:45,001 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-01 17:05:45,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:45,092 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-01 17:05:45,092 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:05:45,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:05:45,141 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-01 17:05:45,189 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-01 17:05:45,189 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-01 17:05:45,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,328 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-01 17:05:45,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,331 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-01 17:05:45,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:45,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:45,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,474 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-01 17:05:45,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,477 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-01 17:05:45,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:45,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:45,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,617 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-01 17:05:45,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:45,620 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-01 17:05:45,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:45,646 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:45,728 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-01 17:05:45,728 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:330, output treesize:279 [2018-12-01 17:05:45,902 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-01 17:05:46,549 WARN L180 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-01 17:05:46,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:46,570 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-01 17:05:46,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-12-01 17:05:46,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:46,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:46,625 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-01 17:05:46,630 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-01 17:05:46,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:46,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:46,664 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-01 17:05:46,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:46,842 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-01 17:05:46,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:46,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, 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-01 17:05:46,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:46,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:46,897 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-01 17:05:46,901 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-01 17:05:46,901 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:46,914 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:46,933 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-01 17:05:47,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,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, 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-01 17:05:47,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,069 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-01 17:05:47,069 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,142 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-01 17:05:47,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:05:47,146 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,165 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,197 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-01 17:05:47,278 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-01 17:05:47,278 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:471, output treesize:280 [2018-12-01 17:05:47,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,420 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-01 17:05:47,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,424 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-01 17:05:47,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,599 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-01 17:05:47,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,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-01 17:05:47,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,745 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-01 17:05:47,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:47,749 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-01 17:05:47,749 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:47,892 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-01 17:05:47,892 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:353, output treesize:302 [2018-12-01 17:05:48,128 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-01 17:05:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:05:48,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:05:48,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:48,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:48,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:48,254 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-01 17:05:48,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:48,266 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-01 17:05:48,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:49,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:49,280 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-01 17:05:49,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 17:05:50,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:50,061 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-01 17:05:50,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-12-01 17:05:50,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:50,244 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-01 17:05:50,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:05:50,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:50,449 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-01 17:05:50,452 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-12-01 17:05:50,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:50,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-12-01 17:05:50,882 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:50,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-01 17:05:51,092 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-01 17:05:51,092 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-01 17:05:51,390 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-01 17:05:51,391 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-01 17:05:51,391 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-01 17:05:51,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-01 17:05:51,477 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-01 17:05:51,477 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-01 17:05:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 17:05:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-01 17:05:51,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-01 17:05:51,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:05:51,477 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:05:51,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:05:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:05:51,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:05:51,602 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-01 17:05:51,608 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-01 17:05:51,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,630 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-01 17:05:51,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,668 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-01 17:05:51,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,716 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-01 17:05:51,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:51,774 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-01 17:05:51,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:51,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:51,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:51,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:51,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:52,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:05:52,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:05:52,102 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-01 17:05:52,928 WARN L180 SmtUtils]: Spent 823.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-01 17:05:52,931 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-01 17:05:52,931 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:52,934 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-01 17:05:52,934 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:52,935 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 17:05:52,935 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:53,080 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-01 17:05:53,080 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:53,193 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-01 17:05:53,198 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-01 17:05:53,198 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 17:05:57,288 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-01 17:05:57,288 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-01 17:05:59,037 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-01 17:05:59,037 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-01 17:06:00,957 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-01 17:06:00,961 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-01 17:06:00,961 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:00,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:01,009 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-01 17:06:01,011 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-01 17:06:01,012 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:01,036 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:01,043 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-01 17:06:02,283 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-01 17:06:02,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 12 treesize of output 11 [2018-12-01 17:06:02,286 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:02,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:02,321 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-01 17:06:02,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01 17:06:02,323 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:02,342 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:02,349 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-01 17:06:03,166 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-01 17:06:03,169 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-01 17:06:03,169 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:03,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:03,210 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-01 17:06:03,212 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-01 17:06:03,213 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:03,239 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:03,246 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-01 17:06:03,756 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-01 17:06:03,758 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-01 17:06:03,759 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:03,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:03,789 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-01 17:06:03,792 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-01 17:06:03,792 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:03,806 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:03,813 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-01 17:06:04,123 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-01 17:06:04,126 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-01 17:06:04,126 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:04,169 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-01 17:06:04,172 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-01 17:06:04,172 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,195 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,202 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-01 17:06:04,411 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-01 17:06:04,414 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-01 17:06:04,414 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:04,450 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-01 17:06:04,453 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-01 17:06:04,453 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,471 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,479 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-01 17:06:04,531 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-01 17:06:04,533 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-01 17:06:04,534 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:04,562 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-01 17:06:04,564 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-01 17:06:04,564 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,576 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:04,583 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-01 17:06:04,629 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-01 17:06:04,756 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-01 17:06:04,775 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-01 17:06:04,776 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 4 xjuncts. [2018-12-01 17:06:04,937 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-01 17:06:04,937 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,043 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-01 17:06:05,046 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-01 17:06:05,046 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:05,074 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-01 17:06:05,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-01 17:06:05,077 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,089 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,096 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-01 17:06:05,109 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-01 17:06:05,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01 17:06:05,112 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:05,140 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-01 17:06:05,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-01 17:06:05,143 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,157 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,164 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-01 17:06:05,175 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-01 17:06:05,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01 17:06:05,178 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:05,204 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-01 17:06:05,207 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-01 17:06:05,207 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,219 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,226 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-01 17:06:05,326 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-01 17:06:05,329 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-01 17:06:05,329 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:05,378 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-01 17:06:05,381 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-01 17:06:05,382 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,405 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:05,414 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-01 17:06:05,500 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-01 17:06:05,693 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-01 17:06:05,897 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-01 17:06:05,898 INFO L202 ElimStorePlain]: Needed 63 recursive calls to eliminate 7 variables, input treesize:408, output treesize:300 [2018-12-01 17:06:06,118 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2018-12-01 17:06:06,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,133 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-01 17:06:06,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,136 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-01 17:06:06,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:06,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:06,174 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-01 17:06:06,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:96 [2018-12-01 17:06:06,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,302 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-01 17:06:06,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,306 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-01 17:06:06,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:06,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, 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-01 17:06:06,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 109 [2018-12-01 17:06:06,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:06,448 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-01 17:06:06,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-01 17:06:06,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:06:06,501 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-01 17:06:06,543 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-01 17:06:06,543 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:160, output treesize:279 [2018-12-01 17:06:06,665 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-01 17:06:06,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,682 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-01 17:06:06,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,686 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-01 17:06:06,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:06,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:06,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,850 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-01 17:06:06,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-01 17:06:06,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:06,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:06,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:06,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:07,001 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-01 17:06:07,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:07,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:06:07,004 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:07,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:07,114 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-01 17:06:07,114 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:330, output treesize:279 [2018-12-01 17:06:07,241 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-01 17:06:07,902 WARN L180 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-01 17:06:07,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:07,923 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-01 17:06:07,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:07,927 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-01 17:06:07,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:07,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:07,979 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-01 17:06:07,983 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-01 17:06:07,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:07,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:08,015 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-01 17:06:08,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:08,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:08,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:08,210 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-01 17:06:08,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:08,214 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-01 17:06:08,214 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:08,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:08,298 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-01 17:06:08,303 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-01 17:06:08,303 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:08,327 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:08,358 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-01 17:06:08,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:08,517 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-01 17:06:08,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:08,522 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-01 17:06:08,522 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:08,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:08,585 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-01 17:06:08,592 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-01 17:06:08,592 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:08,611 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:08,643 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-01 17:06:08,796 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-01 17:06:08,796 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:471, output treesize:280 [2018-12-01 17:06:09,081 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-01 17:06:09,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:09,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, 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-01 17:06:09,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:09,136 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-01 17:06:09,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:09,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:09,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:09,586 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-01 17:06:09,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:09,589 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-01 17:06:09,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:09,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:09,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:09,777 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-01 17:06:09,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:09,781 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-01 17:06:09,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:09,817 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:09,938 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-01 17:06:09,938 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:353, output treesize:302 [2018-12-01 17:06:10,220 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-01 17:06:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:06:10,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:06:10,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:10,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:10,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:10,346 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-01 17:06:10,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:10,374 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-01 17:06:10,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-12-01 17:06:11,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:11,043 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-01 17:06:11,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:11,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:11,344 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-01 17:06:11,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-12-01 17:06:12,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:12,134 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-01 17:06:12,135 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:12,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:12,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 57 treesize of output 75 [2018-12-01 17:06:12,344 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-01 17:06:12,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:12,523 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-01 17:06:12,524 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-12-01 17:06:12,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-01 17:06:12,709 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-01 17:06:12,709 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:76, output treesize:609 [2018-12-01 17:06:13,891 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-01 17:06:13,892 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-01 17:06:13,893 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-01 17:06:13,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-01 17:06:14,309 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-01 17:06:14,309 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-01 17:06:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 17:06:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-12-01 17:06:14,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-01 17:06:14,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:06:14,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 17:06:14,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:06:14,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-01 17:06:14,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:06:14,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2018-12-01 17:06:14,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-01 17:06:14,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 50 transitions. [2018-12-01 17:06:14,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-01 17:06:14,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-01 17:06:14,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2018-12-01 17:06:14,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:06:14,312 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-12-01 17:06:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2018-12-01 17:06:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 23. [2018-12-01 17:06:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-01 17:06:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-12-01 17:06:14,313 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-01 17:06:14,313 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-01 17:06:14,313 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 17:06:14,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-12-01 17:06:14,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:06:14,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:06:14,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:06:14,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2018-12-01 17:06:14,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 17:06:14,315 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 2612#L560-2 [2018-12-01 17:06:14,315 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-01 17:06:14,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:06:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash 47317093, now seen corresponding path program 4 times [2018-12-01 17:06:14,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:06:14,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:06:14,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:06:14,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:06:14,401 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-01 17:06:14,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:06:14,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3482e1a0-516b-468c-be1c-18a6fb6693ec/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-01 17:06:14,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-01 17:06:14,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-01 17:06:14,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 17:06:14,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:06:14,436 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-01 17:06:14,438 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-01 17:06:14,442 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-01 17:06:14,451 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-01 17:06:14,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,471 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-01 17:06:14,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,503 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-01 17:06:14,503 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,572 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-01 17:06:14,573 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:44, output treesize:13 [2018-12-01 17:06:14,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,592 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-01 17:06:14,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:06:14,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, 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-01 17:06:14,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,601 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-01 17:06:14,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:12 [2018-12-01 17:06:14,625 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-01 17:06:14,627 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-01 17:06:14,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:06:14,631 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-01 17:06:14,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2018-12-01 17:06:14,632 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-01 17:06:14,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:06:14,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-01 17:06:14,648 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 17:06:14,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:06:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash 36907, now seen corresponding path program 5 times [2018-12-01 17:06:14,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:06:14,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:06:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:06:14,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:06:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:06:14,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 17:06:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:06:14,729 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-12-01 17:06:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:06:14,803 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-01 17:06:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:06:14,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-12-01 17:06:14,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 17:06:14,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 20 states and 21 transitions. [2018-12-01 17:06:14,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-01 17:06:14,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-01 17:06:14,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-12-01 17:06:14,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:06:14,805 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-01 17:06:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-12-01 17:06:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-01 17:06:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-01 17:06:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-01 17:06:14,807 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-01 17:06:14,807 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-01 17:06:14,807 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 17:06:14,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2018-12-01 17:06:14,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 17:06:14,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:06:14,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:06:14,808 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1] [2018-12-01 17:06:14,808 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 17:06:14,808 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 2724#L560-2 [2018-12-01 17:06:14,808 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~mem18;havoc main_#t~mem17; 2724#L560-2 [2018-12-01 17:06:14,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:06:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash -900755773, now seen corresponding path program 4 times [2018-12-01 17:06:14,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:06:14,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:06:14,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:06:14,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:06:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:06:14,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:06:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2018-12-01 17:06:14,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:06:14,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:06:14,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:06:14,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:06:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:06:14,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:06:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 540439079, now seen corresponding path program 5 times [2018-12-01 17:06:14,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:06:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:06:14,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:06:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:06:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:06:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:06:45,779 WARN L180 SmtUtils]: Spent 30.73 s on a formula simplification. DAG size of input: 296 DAG size of output: 257 [2018-12-01 17:07:00,915 WARN L180 SmtUtils]: Spent 15.13 s on a formula simplification that was a NOOP. DAG size: 200 [2018-12-01 17:07:00,920 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:07:00,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:07:00,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:07:00,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:07:00,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:07:00,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:07:00,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:07:00,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:07:00,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-01 17:07:00,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:07:00,921 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:07:00,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:07:00,925 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-01 17:07:00,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:07:00,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:07:00,928 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-01 17:07:00,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,798 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 130 [2018-12-01 17:08:18,959 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-01 17:08:18,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:18,967 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-01 17:08:18,968 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-01 17:08:18,969 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-01 17:08:18,970 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-01 17:08:18,971 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-01 17:08:19,402 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:08:19,403 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:08:19,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:08:19,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:08:19,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:08:19,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:08:19,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:08:19,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:08:19,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:08:19,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:08:19,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:08:19,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,409 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:08:19,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,409 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:08:19,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:08:19,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,411 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:08:19,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:08:19,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,413 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:08:19,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,414 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:08:19,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,423 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:08:19,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,424 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:08:19,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,437 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:08:19,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:08:19,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,441 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:08:19,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,442 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:08:19,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:08:19,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:08:19,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:08:19,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:08:19,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:08:19,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:08:19,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:08:19,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:08:19,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:08:19,469 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:08:19,476 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-01 17:08:19,476 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 17:08:19,476 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:08:19,477 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:08:19,477 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:08:19,477 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-01 17:08:20,022 INFO L297 tatePredicateManager]: 113 out of 116 supporting invariants were superfluous and have been removed [2018-12-01 17:08:20,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:08:20,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:08:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:08:20,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:08:20,058 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-01 17:08:20,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,069 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-01 17:08:20,072 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-01 17:08:20,077 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-01 17:08:20,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,098 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-01 17:08:20,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,136 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-01 17:08:20,136 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:08:20,150 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:08:20,161 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:08:20,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:08:20,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:08:20,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:08:20,206 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-01 17:08:20,206 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:59, output treesize:17 [2018-12-01 17:08:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:08:20,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:08:20,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,224 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-01 17:08:20,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:08:20,226 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-01 17:08:20,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:08:20,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:08:20,235 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-01 17:08:20,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2018-12-01 17:08:20,244 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-01 17:08:20,245 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-01 17:08:20,245 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 21 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-01 17:08:20,271 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-01 17:08:20,272 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-01 17:08:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:08:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-01 17:08:20,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 17:08:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:08:20,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-01 17:08:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:08:20,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-01 17:08:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:08:20,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-12-01 17:08:20,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:08:20,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 23 transitions. [2018-12-01 17:08:20,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 17:08:20,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 17:08:20,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2018-12-01 17:08:20,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:08:20,273 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-01 17:08:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2018-12-01 17:08:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-01 17:08:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-01 17:08:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-01 17:08:20,274 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-01 17:08:20,274 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-01 17:08:20,274 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 17:08:20,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-12-01 17:08:20,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 17:08:20,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:08:20,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:08:20,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1] [2018-12-01 17:08:20,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 17:08:20,275 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 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~mem18;havoc main_#t~mem17; 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-01 17:08:20,275 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-01 17:08:20,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:08:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342116, now seen corresponding path program 6 times [2018-12-01 17:08:20,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:08:20,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:08:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:08:20,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:08:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:08:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:08:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:08:20,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:08:20,331 INFO L82 PathProgramCache]: Analyzing trace with hash 41857, now seen corresponding path program 6 times [2018-12-01 17:08:20,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:08:20,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:08:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:08:20,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:08:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:08:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:08:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:08:20,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:08:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash -426257666, now seen corresponding path program 5 times [2018-12-01 17:08:20,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:08:20,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:08:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:08:20,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:08:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:08:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:08:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:08:44,256 WARN L180 SmtUtils]: Spent 23.76 s on a formula simplification. DAG size of input: 304 DAG size of output: 265 [2018-12-01 17:08:51,913 WARN L180 SmtUtils]: Spent 7.66 s on a formula simplification that was a NOOP. DAG size: 208 [2018-12-01 17:08:51,919 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:08:51,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:08:51,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:08:51,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:08:51,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:08:51,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:08:51,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:08:51,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:08:51,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-01 17:08:51,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:08:51,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:08:51,922 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-01 17:08:51,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:51,925 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-01 17:08:51,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:08:51,928 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-01 17:10:12,237 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 133 [2018-12-01 17:10:12,398 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-01 17:10:12,398 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-01 17:10:12,403 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-01 17:10:12,404 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-01 17:10:12,405 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-01 17:10:12,406 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-01 17:10:12,407 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-01 17:10:12,408 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-01 17:10:12,409 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-01 17:10:12,410 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-01 17:10:12,411 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-01 17:10:12,412 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-01 17:10:12,412 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-01 17:10:12,413 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-01 17:10:12,414 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-01 17:10:12,632 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-12-01 17:10:12,919 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:10:12,919 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:10:12,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-01 17:10:12,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:10:12,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:10:12,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:10:12,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:10:12,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:10:12,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:10:12,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:10:12,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:10:12,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:10:12,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:10:12,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:10:12,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:10:12,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:10:12,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:10:12,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:10:12,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:10:12,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-01 17:10:12,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:10:12,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:10:12,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:10:12,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:10:12,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:10:12,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:10:12,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:10:12,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:10:12,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:10:12,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:10:12,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:10:12,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:10:12,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:10:12,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:10:12,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:10:12,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:10:12,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:10:12,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:10:12,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:10:12,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:10:12,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:10:12,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:10:12,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:10:12,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:10:12,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:10:12,926 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:10:12,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:10:12,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:10:12,926 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:10:12,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:10:12,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:10:12,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:10:12,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:10:12,928 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:10:12,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:10:12,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:10:12,928 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:10:12,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:10:12,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:10:12,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 17:10:12,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:10:12,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:10:12,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:10:12,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:10:12,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:10:12,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:10:12,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:10:12,939 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:10:12,939 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 17:10:12,939 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:10:12,940 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-01 17:10:12,940 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:10:12,940 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-01 17:10:13,437 INFO L297 tatePredicateManager]: 111 out of 117 supporting invariants were superfluous and have been removed [2018-12-01 17:10:13,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:10:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:10:13,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:10:13,486 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-01 17:10:13,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:10:13,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,501 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-01 17:10:13,505 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-01 17:10:13,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,524 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-01 17:10:13,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,561 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-01 17:10:13,561 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,576 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,640 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-01 17:10:13,641 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2018-12-01 17:10:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:10:13,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:10:13,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,675 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-01 17:10:13,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,678 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-01 17:10:13,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,714 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-01 17:10:13,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 17:10:13,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:10:13,754 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-01 17:10:13,754 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:153 [2018-12-01 17:10:13,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,829 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-01 17:10:13,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,832 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-01 17:10:13,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:13,844 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-01 17:10:13,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-12-01 17:10:13,865 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-01 17:10:13,866 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-01 17:10:13,866 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-01 17:10:13,923 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-01 17:10:13,925 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-01 17:10:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:10:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-01 17:10:13,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-01 17:10:13,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:10:13,925 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:10:13,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:10:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:10:13,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:10:13,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-12-01 17:10:13,968 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-01 17:10:13,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,980 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-01 17:10:13,984 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-01 17:10:13,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:13,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,003 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-01 17:10:14,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,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, 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-01 17:10:14,045 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,061 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,131 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-01 17:10:14,131 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2018-12-01 17:10:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:10:14,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:10:14,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01 17:10:14,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:10:14,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,194 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-01 17:10:14,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 17:10:14,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:10:14,231 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-01 17:10:14,232 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:153 [2018-12-01 17:10:14,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,320 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-01 17:10:14,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,323 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-01 17:10:14,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,335 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-01 17:10:14,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-12-01 17:10:14,353 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-01 17:10:14,354 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-01 17:10:14,354 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-01 17:10:14,415 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-01 17:10:14,417 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-01 17:10:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:10:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-01 17:10:14,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-01 17:10:14,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:10:14,417 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:10:14,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:10:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:10:14,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:10:14,458 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-01 17:10:14,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 17:10:14,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,472 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-01 17:10:14,476 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-01 17:10:14,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,495 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-01 17:10:14,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,541 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-01 17:10:14,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,563 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,600 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,629 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-01 17:10:14,629 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:68, output treesize:23 [2018-12-01 17:10:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:10:14,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:10:14,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,664 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-01 17:10:14,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,667 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-01 17:10:14,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,696 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-01 17:10:14,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-01 17:10:14,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-01 17:10:14,734 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-01 17:10:14,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:153 [2018-12-01 17:10:14,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,790 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-01 17:10:14,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:10:14,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 36 treesize of output 27 [2018-12-01 17:10:14,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:10:14,806 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-01 17:10:14,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-12-01 17:10:14,830 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-01 17:10:14,831 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-01 17:10:14,831 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-01 17:10:14,905 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-01 17:10:14,905 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-01 17:10:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 17:10:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-01 17:10:14,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-01 17:10:14,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:10:14,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-01 17:10:14,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:10:14,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-01 17:10:14,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:10:14,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2018-12-01 17:10:14,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 17:10:14,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-12-01 17:10:14,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 17:10:14,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 17:10:14,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 17:10:14,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:10:14,907 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:10:14,907 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:10:14,907 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:10:14,907 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 17:10:14,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 17:10:14,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 17:10:14,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 17:10:14,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 05:10:14 BoogieIcfgContainer [2018-12-01 17:10:14,911 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 17:10:14,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:10:14,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:10:14,911 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:10:14,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:01:39" (3/4) ... [2018-12-01 17:10:14,914 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 17:10:14,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:10:14,914 INFO L168 Benchmark]: Toolchain (without parser) took 516101.26 ms. Allocated memory was 1.0 GB in the beginning and 11.6 GB in the end (delta: 10.6 GB). Free memory was 950.6 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 7.9 GB. Max. memory is 11.5 GB. [2018-12-01 17:10:14,915 INFO L168 Benchmark]: CDTParser took 0.12 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-01 17:10:14,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:10:14,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.70 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-01 17:10:14,915 INFO L168 Benchmark]: Boogie Preprocessor took 14.00 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-01 17:10:14,915 INFO L168 Benchmark]: RCFGBuilder took 160.91 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-12-01 17:10:14,915 INFO L168 Benchmark]: BuchiAutomizer took 515628.63 ms. Allocated memory was 1.1 GB in the beginning and 11.6 GB in the end (delta: 10.5 GB). Free memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 7.9 GB. Max. memory is 11.5 GB. [2018-12-01 17:10:14,916 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 11.6 GB. Free memory is still 3.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:10:14,916 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.12 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 264.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.70 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.00 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 160.91 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 515628.63 ms. Allocated memory was 1.1 GB in the beginning and 11.6 GB in the end (delta: 10.5 GB). Free memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 7.9 GB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 11.6 GB. Free memory is still 3.6 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 515.6s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 282.7s. Construction of modules took 0.8s. Büchi inclusion checks took 231.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.8s 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: 9ms 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...