./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 129dca108ba5ab1702fbcd782a34bbf933adb446 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:16:54,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:16:54,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:16:54,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:16:54,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:16:54,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:16:54,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:16:54,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:16:54,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:16:54,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:16:54,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:16:54,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:16:54,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:16:54,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:16:54,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:16:54,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:16:54,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:16:54,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:16:54,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:16:54,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:16:54,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:16:54,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:16:54,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:16:54,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:16:54,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:16:54,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:16:54,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:16:54,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:16:54,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:16:54,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:16:54,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:16:54,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:16:54,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:16:54,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:16:54,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:16:54,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:16:54,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:16:54,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:16:54,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:16:54,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:16:54,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:16:54,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 17:16:55,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:16:55,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:16:55,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:16:55,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:16:55,006 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:16:55,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:16:55,007 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:16:55,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:16:55,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:16:55,007 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:16:55,008 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:16:55,008 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:16:55,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:16:55,008 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:16:55,008 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:16:55,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:16:55,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:16:55,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:16:55,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:16:55,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:16:55,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:16:55,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:16:55,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:16:55,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:16:55,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2019-11-25 17:16:55,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:16:55,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:16:55,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:16:55,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:16:55,347 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:16:55,348 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-25 17:16:55,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690eaa8be/1d92f053e2dc4deb8a44edc5efd7c76f/FLAGc5c513154 [2019-11-25 17:16:55,966 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:16:55,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-25 17:16:55,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690eaa8be/1d92f053e2dc4deb8a44edc5efd7c76f/FLAGc5c513154 [2019-11-25 17:16:56,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690eaa8be/1d92f053e2dc4deb8a44edc5efd7c76f [2019-11-25 17:16:56,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:16:56,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:16:56,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:16:56,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:16:56,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:16:56,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573c7019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56, skipping insertion in model container [2019-11-25 17:16:56,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:16:56,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:16:56,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:16:56,785 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:16:56,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:16:56,911 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:16:56,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56 WrapperNode [2019-11-25 17:16:56,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:16:56,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:16:56,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:16:56,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:16:56,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (1/1) ... [2019-11-25 17:16:56,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:16:56,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:16:57,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:16:57,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:16:57,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:16:57,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:16:57,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:16:57,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-25 17:16:57,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:16:57,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:16:57,064 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-25 17:16:57,065 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-25 17:16:57,065 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-25 17:16:57,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:16:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:16:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:16:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:16:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:16:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:16:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:16:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:16:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:16:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:16:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:16:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:16:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:16:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:16:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:16:57,067 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:16:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:16:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:16:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:16:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:16:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:16:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:16:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:16:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:16:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:16:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:16:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:16:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:16:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:16:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:16:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:16:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:16:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:16:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:16:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:16:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:16:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:16:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:16:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:16:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:16:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:16:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:16:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:16:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:16:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:16:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:16:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:16:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:16:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:16:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:16:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:16:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:16:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:16:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:16:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:16:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:16:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:16:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-25 17:16:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:16:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:16:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:16:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 17:16:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:16:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:16:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 17:16:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 17:16:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:16:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:16:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:16:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:16:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:16:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:16:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:16:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:16:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:16:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:16:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:16:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:16:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:16:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:16:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:16:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:16:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:16:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:16:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:16:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:16:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:16:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:16:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:16:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:16:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:16:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:16:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:16:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:16:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:16:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:16:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:16:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:16:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:16:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:16:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:16:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:16:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:16:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:16:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 17:16:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-25 17:16:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-25 17:16:57,091 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 17:16:57,091 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-25 17:16:57,091 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-25 17:16:57,091 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-25 17:16:57,091 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-25 17:16:57,091 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-25 17:16:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-25 17:16:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-25 17:16:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-25 17:16:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-25 17:16:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-25 17:16:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-25 17:16:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-25 17:16:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-25 17:16:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-25 17:16:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-25 17:16:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-25 17:16:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-25 17:16:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-25 17:16:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-25 17:16:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-25 17:16:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-25 17:16:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-25 17:16:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-25 17:16:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-25 17:16:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-25 17:16:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-25 17:16:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-25 17:16:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-25 17:16:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-25 17:16:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-25 17:16:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-25 17:16:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-25 17:16:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-25 17:16:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-25 17:16:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-25 17:16:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-25 17:16:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-25 17:16:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-25 17:16:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-25 17:16:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:16:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:16:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:16:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:16:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:16:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:16:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-25 17:16:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 17:16:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:16:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:16:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:16:57,874 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:16:57,874 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 17:16:57,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:16:57 BoogieIcfgContainer [2019-11-25 17:16:57,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:16:57,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:16:57,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:16:57,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:16:57,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:16:56" (1/3) ... [2019-11-25 17:16:57,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c13ee0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:16:57, skipping insertion in model container [2019-11-25 17:16:57,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:16:56" (2/3) ... [2019-11-25 17:16:57,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c13ee0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:16:57, skipping insertion in model container [2019-11-25 17:16:57,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:16:57" (3/3) ... [2019-11-25 17:16:57,893 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-25 17:16:57,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:16:57,912 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-25 17:16:57,924 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-25 17:16:57,943 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:16:57,943 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:16:57,943 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:16:57,943 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:16:57,943 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:16:57,944 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:16:57,944 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:16:57,944 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:16:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-25 17:16:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 17:16:57,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:16:57,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:16:57,974 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:16:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:16:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989328, now seen corresponding path program 1 times [2019-11-25 17:16:57,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:16:57,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588587995] [2019-11-25 17:16:57,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:16:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:16:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:16:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:16:58,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588587995] [2019-11-25 17:16:58,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:16:58,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 17:16:58,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396307404] [2019-11-25 17:16:58,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:16:58,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:16:58,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:16:58,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:16:58,486 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-25 17:16:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:16:59,034 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-11-25 17:16:59,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:16:59,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-25 17:16:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:16:59,049 INFO L225 Difference]: With dead ends: 105 [2019-11-25 17:16:59,050 INFO L226 Difference]: Without dead ends: 96 [2019-11-25 17:16:59,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:16:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-25 17:16:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-11-25 17:16:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 17:16:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2019-11-25 17:16:59,121 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 9 [2019-11-25 17:16:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:16:59,121 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2019-11-25 17:16:59,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:16:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2019-11-25 17:16:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 17:16:59,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:16:59,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:16:59,126 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:16:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:16:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989329, now seen corresponding path program 1 times [2019-11-25 17:16:59,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:16:59,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209681788] [2019-11-25 17:16:59,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:16:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:16:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:16:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:16:59,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209681788] [2019-11-25 17:16:59,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:16:59,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:16:59,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918902105] [2019-11-25 17:16:59,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:16:59,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:16:59,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:16:59,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:16:59,430 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand 6 states. [2019-11-25 17:17:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:00,392 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2019-11-25 17:17:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:17:00,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-25 17:17:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:00,396 INFO L225 Difference]: With dead ends: 176 [2019-11-25 17:17:00,396 INFO L226 Difference]: Without dead ends: 176 [2019-11-25 17:17:00,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:17:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-25 17:17:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2019-11-25 17:17:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-25 17:17:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2019-11-25 17:17:00,439 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 9 [2019-11-25 17:17:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:00,439 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2019-11-25 17:17:00,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:17:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2019-11-25 17:17:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 17:17:00,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:00,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:00,441 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:00,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1859028932, now seen corresponding path program 1 times [2019-11-25 17:17:00,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:00,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247149805] [2019-11-25 17:17:00,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:00,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247149805] [2019-11-25 17:17:00,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:00,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:17:00,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638387981] [2019-11-25 17:17:00,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:17:00,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:17:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:17:00,832 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand 6 states. [2019-11-25 17:17:01,058 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-25 17:17:01,211 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-11-25 17:17:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:02,063 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-11-25 17:17:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:17:02,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-25 17:17:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:02,068 INFO L225 Difference]: With dead ends: 270 [2019-11-25 17:17:02,068 INFO L226 Difference]: Without dead ends: 270 [2019-11-25 17:17:02,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:17:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-25 17:17:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 219. [2019-11-25 17:17:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-25 17:17:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2019-11-25 17:17:02,099 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 10 [2019-11-25 17:17:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:02,099 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2019-11-25 17:17:02,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:17:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2019-11-25 17:17:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 17:17:02,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:02,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:02,100 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1795322128, now seen corresponding path program 1 times [2019-11-25 17:17:02,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:02,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012860366] [2019-11-25 17:17:02,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:02,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012860366] [2019-11-25 17:17:02,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:02,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:17:02,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957365430] [2019-11-25 17:17:02,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:17:02,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:02,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:17:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:17:02,414 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand 6 states. [2019-11-25 17:17:02,663 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-25 17:17:02,862 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-11-25 17:17:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:03,605 INFO L93 Difference]: Finished difference Result 256 states and 361 transitions. [2019-11-25 17:17:03,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 17:17:03,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-25 17:17:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:03,610 INFO L225 Difference]: With dead ends: 256 [2019-11-25 17:17:03,610 INFO L226 Difference]: Without dead ends: 256 [2019-11-25 17:17:03,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:17:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-25 17:17:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2019-11-25 17:17:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-25 17:17:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 322 transitions. [2019-11-25 17:17:03,633 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 322 transitions. Word has length 11 [2019-11-25 17:17:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:03,633 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 322 transitions. [2019-11-25 17:17:03,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:17:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 322 transitions. [2019-11-25 17:17:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 17:17:03,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:03,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:03,634 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash -179588794, now seen corresponding path program 1 times [2019-11-25 17:17:03,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:03,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897887593] [2019-11-25 17:17:03,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:03,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897887593] [2019-11-25 17:17:03,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:03,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:17:03,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836088162] [2019-11-25 17:17:03,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:17:03,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:03,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:17:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:17:03,760 INFO L87 Difference]: Start difference. First operand 219 states and 322 transitions. Second operand 7 states. [2019-11-25 17:17:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:04,775 INFO L93 Difference]: Finished difference Result 290 states and 395 transitions. [2019-11-25 17:17:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:17:04,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-25 17:17:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:04,780 INFO L225 Difference]: With dead ends: 290 [2019-11-25 17:17:04,780 INFO L226 Difference]: Without dead ends: 290 [2019-11-25 17:17:04,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:17:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-25 17:17:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 254. [2019-11-25 17:17:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 17:17:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-25 17:17:04,800 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 12 [2019-11-25 17:17:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:04,801 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-25 17:17:04,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:17:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-25 17:17:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 17:17:04,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:04,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:04,802 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1272285230, now seen corresponding path program 1 times [2019-11-25 17:17:04,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:04,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50957499] [2019-11-25 17:17:04,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:05,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50957499] [2019-11-25 17:17:05,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:05,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:17:05,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564425400] [2019-11-25 17:17:05,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:17:05,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:17:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:17:05,028 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 7 states. [2019-11-25 17:17:05,262 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-25 17:17:05,458 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-25 17:17:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:06,100 INFO L93 Difference]: Finished difference Result 280 states and 383 transitions. [2019-11-25 17:17:06,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:17:06,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-25 17:17:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:06,124 INFO L225 Difference]: With dead ends: 280 [2019-11-25 17:17:06,128 INFO L226 Difference]: Without dead ends: 280 [2019-11-25 17:17:06,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:17:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-25 17:17:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 254. [2019-11-25 17:17:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 17:17:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-25 17:17:06,165 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 13 [2019-11-25 17:17:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:06,165 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-25 17:17:06,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:17:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-25 17:17:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:17:06,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:06,167 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:06,169 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash 668439832, now seen corresponding path program 1 times [2019-11-25 17:17:06,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:06,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253550334] [2019-11-25 17:17:06,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:06,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253550334] [2019-11-25 17:17:06,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198682283] [2019-11-25 17:17:06,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:17:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:06,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:17:06,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:17:06,865 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-25 17:17:06,866 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-25 17:17:06,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-25 17:17:06,868 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:06,939 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-25 17:17:06,941 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:17:06,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-25 17:17:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:07,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:17:07,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-11-25 17:17:07,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637489546] [2019-11-25 17:17:07,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:17:07,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:07,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:17:07,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:17:07,001 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 10 states. [2019-11-25 17:17:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:08,001 INFO L93 Difference]: Finished difference Result 301 states and 422 transitions. [2019-11-25 17:17:08,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:17:08,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 17:17:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:08,004 INFO L225 Difference]: With dead ends: 301 [2019-11-25 17:17:08,004 INFO L226 Difference]: Without dead ends: 301 [2019-11-25 17:17:08,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:17:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-25 17:17:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 257. [2019-11-25 17:17:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-25 17:17:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 367 transitions. [2019-11-25 17:17:08,022 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 367 transitions. Word has length 17 [2019-11-25 17:17:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:08,023 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 367 transitions. [2019-11-25 17:17:08,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:17:08,023 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 367 transitions. [2019-11-25 17:17:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 17:17:08,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:08,024 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:08,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:17:08,234 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash -753201699, now seen corresponding path program 1 times [2019-11-25 17:17:08,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:08,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636809387] [2019-11-25 17:17:08,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:08,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636809387] [2019-11-25 17:17:08,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273421795] [2019-11-25 17:17:08,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:17:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:08,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 17:17:08,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:17:09,107 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2019-11-25 17:17:09,109 INFO L343 Elim1Store]: treesize reduction 487, result has 22.1 percent of original size [2019-11-25 17:17:09,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 324 treesize of output 420 [2019-11-25 17:17:09,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:09,439 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:09,898 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 61 [2019-11-25 17:17:09,899 INFO L588 ElimStorePlain]: treesize reduction 12278, result has 1.1 percent of original size [2019-11-25 17:17:09,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:09,909 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:17:09,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:120, output treesize:134 [2019-11-25 17:17:09,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:09,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:10,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:10,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:10,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:10,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:11,759 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-25 17:17:14,901 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 123 [2019-11-25 17:17:14,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:17:14,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 25 [2019-11-25 17:17:14,938 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:15,066 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-25 17:17:15,067 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:15,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 28 [2019-11-25 17:17:15,075 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:15,205 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-25 17:17:15,205 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:15,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 25 [2019-11-25 17:17:15,212 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:15,342 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 17:17:15,343 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:15,345 INFO L508 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 3 xjuncts. [2019-11-25 17:17:15,345 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 17 variables, input treesize:307, output treesize:222 [2019-11-25 17:17:17,557 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-25 17:17:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:17,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:17:17,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2019-11-25 17:17:17,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456454773] [2019-11-25 17:17:17,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 17:17:17,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 17:17:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-25 17:17:17,571 INFO L87 Difference]: Start difference. First operand 257 states and 367 transitions. Second operand 15 states. [2019-11-25 17:17:19,403 WARN L192 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 119 [2019-11-25 17:17:21,612 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 195 DAG size of output: 178 [2019-11-25 17:17:21,891 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-11-25 17:17:22,742 WARN L192 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 178 [2019-11-25 17:17:23,202 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-11-25 17:17:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:25,191 INFO L93 Difference]: Finished difference Result 320 states and 444 transitions. [2019-11-25 17:17:25,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 17:17:25,192 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-25 17:17:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:25,195 INFO L225 Difference]: With dead ends: 320 [2019-11-25 17:17:25,195 INFO L226 Difference]: Without dead ends: 320 [2019-11-25 17:17:25,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:17:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-25 17:17:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-11-25 17:17:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-25 17:17:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 374 transitions. [2019-11-25 17:17:25,209 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 374 transitions. Word has length 18 [2019-11-25 17:17:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:25,210 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 374 transitions. [2019-11-25 17:17:25,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 17:17:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 374 transitions. [2019-11-25 17:17:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 17:17:25,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:25,211 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:25,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:17:25,422 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1874416105, now seen corresponding path program 1 times [2019-11-25 17:17:25,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:25,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854078429] [2019-11-25 17:17:25,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:25,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854078429] [2019-11-25 17:17:25,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999552030] [2019-11-25 17:17:25,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:17:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:25,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:17:25,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:17:25,960 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_35|], 23=[|v_#valid_49|]} [2019-11-25 17:17:25,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:25,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,021 INFO L343 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2019-11-25 17:17:26,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2019-11-25 17:17:26,021 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:26,060 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:26,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:26,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:26,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 223 [2019-11-25 17:17:26,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:26,150 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:26,452 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-25 17:17:26,452 INFO L588 ElimStorePlain]: treesize reduction 1486, result has 6.2 percent of original size [2019-11-25 17:17:26,453 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 17:17:26,454 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:135, output treesize:99 [2019-11-25 17:17:26,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 21 [2019-11-25 17:17:26,702 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:26,747 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:26,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-25 17:17:26,752 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:26,788 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:26,789 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:17:26,789 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:66 [2019-11-25 17:17:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:26,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:17:26,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2019-11-25 17:17:26,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837756051] [2019-11-25 17:17:26,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 17:17:26,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:26,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 17:17:26,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:17:26,842 INFO L87 Difference]: Start difference. First operand 263 states and 374 transitions. Second operand 14 states. [2019-11-25 17:17:27,201 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-11-25 17:17:27,420 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-25 17:17:27,714 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-25 17:17:28,273 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-11-25 17:17:28,655 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-11-25 17:17:29,201 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-11-25 17:17:29,671 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-11-25 17:17:30,110 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-11-25 17:17:30,507 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-11-25 17:17:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:31,324 INFO L93 Difference]: Finished difference Result 310 states and 433 transitions. [2019-11-25 17:17:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 17:17:31,324 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-25 17:17:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:31,327 INFO L225 Difference]: With dead ends: 310 [2019-11-25 17:17:31,328 INFO L226 Difference]: Without dead ends: 310 [2019-11-25 17:17:31,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-11-25 17:17:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-25 17:17:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-11-25 17:17:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-25 17:17:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 371 transitions. [2019-11-25 17:17:31,341 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 371 transitions. Word has length 19 [2019-11-25 17:17:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:31,341 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 371 transitions. [2019-11-25 17:17:31,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 17:17:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 371 transitions. [2019-11-25 17:17:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 17:17:31,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:31,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:31,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:17:31,547 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:31,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash 550421903, now seen corresponding path program 1 times [2019-11-25 17:17:31,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:31,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167219527] [2019-11-25 17:17:31,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:31,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167219527] [2019-11-25 17:17:31,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:31,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 17:17:31,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056939812] [2019-11-25 17:17:31,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:17:31,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:31,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:17:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:17:31,643 INFO L87 Difference]: Start difference. First operand 263 states and 371 transitions. Second operand 4 states. [2019-11-25 17:17:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:31,911 INFO L93 Difference]: Finished difference Result 262 states and 369 transitions. [2019-11-25 17:17:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:17:31,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-25 17:17:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:31,917 INFO L225 Difference]: With dead ends: 262 [2019-11-25 17:17:31,917 INFO L226 Difference]: Without dead ends: 262 [2019-11-25 17:17:31,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:17:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-25 17:17:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-11-25 17:17:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-25 17:17:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2019-11-25 17:17:31,932 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 23 [2019-11-25 17:17:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:31,933 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2019-11-25 17:17:31,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:17:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2019-11-25 17:17:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 17:17:31,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:31,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:31,939 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:31,940 INFO L82 PathProgramCache]: Analyzing trace with hash -116790132, now seen corresponding path program 1 times [2019-11-25 17:17:31,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:31,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530173886] [2019-11-25 17:17:31,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:32,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530173886] [2019-11-25 17:17:32,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:32,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 17:17:32,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79793787] [2019-11-25 17:17:32,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:17:32,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:32,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:17:32,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:17:32,038 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 4 states. [2019-11-25 17:17:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:32,290 INFO L93 Difference]: Finished difference Result 195 states and 262 transitions. [2019-11-25 17:17:32,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 17:17:32,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-25 17:17:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:32,293 INFO L225 Difference]: With dead ends: 195 [2019-11-25 17:17:32,293 INFO L226 Difference]: Without dead ends: 195 [2019-11-25 17:17:32,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:17:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-25 17:17:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2019-11-25 17:17:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-25 17:17:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2019-11-25 17:17:32,301 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 24 [2019-11-25 17:17:32,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:32,301 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2019-11-25 17:17:32,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:17:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2019-11-25 17:17:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 17:17:32,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:32,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:32,303 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash -29640501, now seen corresponding path program 1 times [2019-11-25 17:17:32,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:32,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535206697] [2019-11-25 17:17:32,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:32,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535206697] [2019-11-25 17:17:32,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:32,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 17:17:32,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694161257] [2019-11-25 17:17:32,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:17:32,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:32,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:17:32,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:17:32,399 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand 4 states. [2019-11-25 17:17:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:32,731 INFO L93 Difference]: Finished difference Result 253 states and 346 transitions. [2019-11-25 17:17:32,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:17:32,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-25 17:17:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:32,734 INFO L225 Difference]: With dead ends: 253 [2019-11-25 17:17:32,734 INFO L226 Difference]: Without dead ends: 253 [2019-11-25 17:17:32,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:17:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-25 17:17:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 239. [2019-11-25 17:17:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-25 17:17:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 337 transitions. [2019-11-25 17:17:32,752 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 337 transitions. Word has length 24 [2019-11-25 17:17:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:32,753 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 337 transitions. [2019-11-25 17:17:32,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:17:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 337 transitions. [2019-11-25 17:17:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 17:17:32,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:32,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:32,758 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash -918855488, now seen corresponding path program 1 times [2019-11-25 17:17:32,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:32,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073302676] [2019-11-25 17:17:32,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:32,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073302676] [2019-11-25 17:17:32,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:32,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 17:17:32,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690183813] [2019-11-25 17:17:32,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:17:32,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:32,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:17:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:17:32,916 INFO L87 Difference]: Start difference. First operand 239 states and 337 transitions. Second operand 4 states. [2019-11-25 17:17:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:33,289 INFO L93 Difference]: Finished difference Result 257 states and 350 transitions. [2019-11-25 17:17:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:17:33,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-25 17:17:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:33,292 INFO L225 Difference]: With dead ends: 257 [2019-11-25 17:17:33,292 INFO L226 Difference]: Without dead ends: 257 [2019-11-25 17:17:33,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:17:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-25 17:17:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2019-11-25 17:17:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-25 17:17:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 339 transitions. [2019-11-25 17:17:33,302 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 339 transitions. Word has length 25 [2019-11-25 17:17:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:33,302 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 339 transitions. [2019-11-25 17:17:33,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:17:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 339 transitions. [2019-11-25 17:17:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 17:17:33,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:33,303 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:33,304 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2138371761, now seen corresponding path program 1 times [2019-11-25 17:17:33,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:33,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576362835] [2019-11-25 17:17:33,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:17:33,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576362835] [2019-11-25 17:17:33,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:17:33,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 17:17:33,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619934610] [2019-11-25 17:17:33,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:17:33,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:33,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:17:33,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:17:33,445 INFO L87 Difference]: Start difference. First operand 241 states and 339 transitions. Second operand 5 states. [2019-11-25 17:17:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:17:33,682 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2019-11-25 17:17:33,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 17:17:33,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-25 17:17:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:17:33,684 INFO L225 Difference]: With dead ends: 202 [2019-11-25 17:17:33,684 INFO L226 Difference]: Without dead ends: 202 [2019-11-25 17:17:33,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:17:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-25 17:17:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2019-11-25 17:17:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-25 17:17:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 263 transitions. [2019-11-25 17:17:33,693 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 263 transitions. Word has length 33 [2019-11-25 17:17:33,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:17:33,694 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 263 transitions. [2019-11-25 17:17:33,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:17:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 263 transitions. [2019-11-25 17:17:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 17:17:33,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:17:33,695 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:17:33,696 INFO L410 AbstractCegarLoop]: === Iteration 15 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:17:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:17:33,696 INFO L82 PathProgramCache]: Analyzing trace with hash -138461554, now seen corresponding path program 1 times [2019-11-25 17:17:33,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:17:33,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528504705] [2019-11-25 17:17:33,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:17:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 17:17:33,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528504705] [2019-11-25 17:17:33,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556001880] [2019-11-25 17:17:33,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:17:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:17:33,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 17:17:34,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:17:34,233 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2019-11-25 17:17:34,234 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-25 17:17:34,235 INFO L377 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 11 case distinctions, treesize of input 202 treesize of output 258 [2019-11-25 17:17:34,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:17:34,257 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:34,557 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-11-25 17:17:34,558 INFO L588 ElimStorePlain]: treesize reduction 1301, result has 6.8 percent of original size [2019-11-25 17:17:34,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:34,566 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:17:34,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:95 [2019-11-25 17:17:34,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:34,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:35,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:36,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:36,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:37,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:37,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 59 [2019-11-25 17:17:37,024 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:37,029 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:17:37,030 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:37,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:37,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 59 [2019-11-25 17:17:37,084 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:37,137 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:37,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 59 [2019-11-25 17:17:37,138 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:37,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:37,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:37,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:37,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:17:37,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:37,215 INFO L377 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 7 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 78 [2019-11-25 17:17:37,216 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:37,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:37,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 59 [2019-11-25 17:17:37,268 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:37,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:17:37,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 59 [2019-11-25 17:17:37,299 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:17:37,616 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-25 17:17:37,616 INFO L588 ElimStorePlain]: treesize reduction 52, result has 81.0 percent of original size [2019-11-25 17:17:37,618 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-25 17:17:37,618 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:527, output treesize:12 [2019-11-25 17:17:37,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:38,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:17:38,640 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-25 17:17:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 17:17:38,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:17:38,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-25 17:17:38,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180419367] [2019-11-25 17:17:38,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:17:38,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:17:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:17:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:17:38,853 INFO L87 Difference]: Start difference. First operand 197 states and 263 transitions. Second operand 12 states. [2019-11-25 17:17:40,739 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 150 DAG size of output: 106 [2019-11-25 17:17:46,904 WARN L192 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-25 17:18:14,356 WARN L192 SmtUtils]: Spent 27.34 s on a formula simplification. DAG size of input: 167 DAG size of output: 109 [2019-11-25 17:18:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:18:35,866 INFO L93 Difference]: Finished difference Result 279 states and 357 transitions. [2019-11-25 17:18:35,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:18:35,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-25 17:18:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:18:35,871 INFO L225 Difference]: With dead ends: 279 [2019-11-25 17:18:35,871 INFO L226 Difference]: Without dead ends: 279 [2019-11-25 17:18:35,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:18:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-25 17:18:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 245. [2019-11-25 17:18:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-25 17:18:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 333 transitions. [2019-11-25 17:18:35,887 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 333 transitions. Word has length 33 [2019-11-25 17:18:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:18:35,887 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 333 transitions. [2019-11-25 17:18:35,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:18:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 333 transitions. [2019-11-25 17:18:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 17:18:35,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:18:35,888 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:18:36,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:18:36,092 INFO L410 AbstractCegarLoop]: === Iteration 16 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:18:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:18:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash -615136466, now seen corresponding path program 1 times [2019-11-25 17:18:36,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:18:36,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606323440] [2019-11-25 17:18:36,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:18:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:18:36,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606323440] [2019-11-25 17:18:36,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538513079] [2019-11-25 17:18:36,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:18:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:36,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-25 17:18:36,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:18:36,774 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-25 17:18:36,774 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-25 17:18:36,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-25 17:18:36,775 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:36,875 INFO L588 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-25 17:18:37,089 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-25 17:18:37,090 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-25 17:18:37,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-25 17:18:37,091 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:37,222 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-25 17:18:37,223 INFO L588 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-25 17:18:37,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:18:37,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:18:37,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,256 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:18:37,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-25 17:18:37,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:18:37,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:18:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:18:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:18:37,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,379 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:18:37,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:18:37,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:18:37,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,676 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:18:37,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:18:37,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:18:37,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:37,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:37,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:37,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:37,917 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:18:38,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:38,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:38,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:18:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:38,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:38,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:38,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:38,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:18:38,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:38,178 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:18:38,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:38,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:18:38,305 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:38,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2019-11-25 17:18:38,417 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:38,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:18:38,488 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:38,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2019-11-25 17:18:38,547 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:38,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26 treesize of output 96 [2019-11-25 17:18:38,642 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,662 INFO L377 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 5 treesize of output 3 [2019-11-25 17:18:38,663 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:38,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:38,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-25 17:18:38,701 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,720 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:38,720 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,741 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:38,741 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:38,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2019-11-25 17:18:38,811 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,833 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:38,834 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,853 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:38,854 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,873 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:38,873 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,893 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:38,893 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,913 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:38,914 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:38,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:38,918 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:38,918 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:38,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:38,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 29 [2019-11-25 17:18:38,936 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,954 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:38,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:38,956 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:38,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-11-25 17:18:38,959 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,978 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:38,978 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:38,997 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:38,997 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,015 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,016 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:39,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2019-11-25 17:18:39,041 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:39,100 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-25 17:18:39,102 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:18:39,158 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,179 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,179 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,198 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,199 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:39,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-25 17:18:39,259 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,279 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,279 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,298 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,298 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2019-11-25 17:18:39,361 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,380 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,380 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:18:39,433 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,452 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,453 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:39,485 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 56 [2019-11-25 17:18:39,516 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:18:39,562 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:18:39,604 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,625 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,626 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,657 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,657 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,675 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,676 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,698 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:39,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:18:39,723 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,740 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,741 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,764 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 26 treesize of output 64 [2019-11-25 17:18:39,808 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,826 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,827 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:39,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2019-11-25 17:18:39,858 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:39,918 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:39,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:39,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 91 [2019-11-25 17:18:39,970 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:39,988 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:39,989 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,008 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,009 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,051 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:18:40,052 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,085 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 37 [2019-11-25 17:18:40,100 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:40,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:18:40,141 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,159 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,160 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,177 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,177 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,197 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,198 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,215 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,215 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:40,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-25 17:18:40,292 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:18:40,319 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,337 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,337 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,358 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,358 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,378 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2019-11-25 17:18:40,388 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,409 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,409 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,428 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,429 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,461 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:40,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 91 [2019-11-25 17:18:40,530 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,552 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,553 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,575 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:18:40,576 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 37 [2019-11-25 17:18:40,623 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:40,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:18:40,671 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,689 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,689 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,706 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,707 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:40,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-25 17:18:40,746 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,769 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,769 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,775 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,776 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-25 17:18:40,782 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,806 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,806 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,824 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,825 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:40,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:18:40,867 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,885 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,886 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,910 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:40,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 37 [2019-11-25 17:18:40,937 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,954 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:40,955 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:40,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:40,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:40,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-25 17:18:40,994 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,023 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:41,028 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,029 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:41,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 29 [2019-11-25 17:18:41,041 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,063 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:41,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-25 17:18:41,071 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:41,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,092 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2019-11-25 17:18:41,094 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,112 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,112 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,134 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:41,142 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:41,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 29 [2019-11-25 17:18:41,157 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:41,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:18:41,182 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:41,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 17:18:41,204 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,223 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,223 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:18:41,245 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,261 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,261 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:41,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 18 [2019-11-25 17:18:41,292 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,309 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,309 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,326 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,326 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,353 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:41,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-25 17:18:41,354 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,370 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,371 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,388 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,388 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,416 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,416 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,440 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,440 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,460 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,460 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,477 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,477 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,494 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,494 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,511 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,514 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,515 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,515 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 7 [2019-11-25 17:18:41,517 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,534 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,535 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,552 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,552 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,568 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,568 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,582 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,583 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:41,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-25 17:18:41,615 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,631 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,631 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,646 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,646 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,666 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,666 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,685 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,685 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,701 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,701 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,717 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,717 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,735 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,735 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,736 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,739 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,741 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:41,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 18 [2019-11-25 17:18:41,750 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,766 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,766 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,781 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,782 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,798 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,798 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,813 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,814 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,830 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,831 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,832 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:18:41,834 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,849 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,849 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,866 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,867 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,881 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,882 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,897 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,898 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,912 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,913 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,928 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,928 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,952 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,953 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:41,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:18:41,954 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,969 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:41,969 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:41,986 INFO L377 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 5 treesize of output 3 [2019-11-25 17:18:42,014 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,032 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,033 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,043 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,043 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,052 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,052 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,062 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,063 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,071 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,072 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,082 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,082 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,091 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,092 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,102 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,102 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,120 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,121 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,132 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,133 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,141 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,142 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,149 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,150 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,158 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,158 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,167 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,168 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,175 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,175 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,182 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,183 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,192 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,192 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,201 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,202 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,210 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,211 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,218 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,219 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,226 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,226 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,256 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,257 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,265 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,265 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,273 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,273 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,282 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,282 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,290 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,291 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,298 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:18:42,299 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,459 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-11-25 17:18:42,460 INFO L588 ElimStorePlain]: treesize reduction 812, result has 4.8 percent of original size [2019-11-25 17:18:42,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:42,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:18:42,474 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:42,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2019-11-25 17:18:42,480 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,510 INFO L588 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-25 17:18:42,510 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,510 INFO L221 ElimStorePlain]: Needed 153 recursive calls to eliminate 7 variables, input treesize:7571, output treesize:10 [2019-11-25 17:18:42,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:42,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:42,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:18:42,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:42,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:42,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:42,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:42,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:18:42,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:18:42,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:18:42,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:42,595 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:18:42,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:42,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 115 [2019-11-25 17:18:42,793 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:42,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:42,878 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:42,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:42,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:42,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:42,969 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:42,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 36 treesize of output 150 [2019-11-25 17:18:43,142 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-25 17:18:43,181 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,238 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:43,274 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:43,275 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,309 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:43,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2019-11-25 17:18:43,322 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:43,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:43,382 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:43,445 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:43,446 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-25 17:18:43,488 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 115 [2019-11-25 17:18:43,620 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:43,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2019-11-25 17:18:43,661 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:43,732 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:43,854 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:43,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:43,914 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:43,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:43,974 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:44,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:44,011 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:44,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:44,103 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:44,172 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:44,296 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 80 [2019-11-25 17:18:44,391 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,462 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:44,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 107 [2019-11-25 17:18:44,524 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:44,612 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,733 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:44,735 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:44,862 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:44,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:44,923 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:44,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:44,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 36 treesize of output 158 [2019-11-25 17:18:45,106 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:45,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:45,171 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:45,265 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:45,266 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:45,393 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:45,483 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:45,543 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:45,633 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 36 treesize of output 150 [2019-11-25 17:18:45,810 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:45,901 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,960 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:45,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:45,961 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:45,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:45,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:46,054 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:46,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 107 [2019-11-25 17:18:46,187 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-25 17:18:46,253 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-25 17:18:46,293 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:46,378 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 115 [2019-11-25 17:18:46,515 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-25 17:18:46,554 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:46,643 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:46,644 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 115 [2019-11-25 17:18:46,773 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:46,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:46,895 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:46,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:46,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,066 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 36 treesize of output 150 [2019-11-25 17:18:47,067 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:47,139 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,196 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:47,197 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 115 [2019-11-25 17:18:47,322 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 80 [2019-11-25 17:18:47,415 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,543 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 115 [2019-11-25 17:18:47,544 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,598 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:47,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:47,638 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:47,725 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:47,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2019-11-25 17:18:47,769 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,823 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:47,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:47,865 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:47,951 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:47,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:48,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:48,014 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:48,101 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:48,205 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:48,337 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:48,425 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 80 [2019-11-25 17:18:48,517 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:48,643 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:48,770 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 31 treesize of output 115 [2019-11-25 17:18:48,902 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 36 treesize of output 158 [2019-11-25 17:18:49,081 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:49,136 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:49,225 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:49,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:49,290 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:49,347 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:49,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:49,436 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:49,493 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:49,614 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:49,676 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:49,677 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,866 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 17:18:49,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 36 treesize of output 150 [2019-11-25 17:18:49,868 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:49,956 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:50,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 107 [2019-11-25 17:18:50,084 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,116 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:50,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2019-11-25 17:18:50,126 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:50,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2019-11-25 17:18:50,170 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,206 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:50,228 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:50,229 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,282 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:50,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 72 [2019-11-25 17:18:50,321 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,379 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2019-11-25 17:18:50,380 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 36 treesize of output 158 [2019-11-25 17:18:50,563 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,625 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:50,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:50,645 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 31 treesize of output 107 [2019-11-25 17:18:50,770 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,799 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:50,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2019-11-25 17:18:50,813 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:50,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 80 [2019-11-25 17:18:50,909 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:50,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:50,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 80 [2019-11-25 17:18:51,028 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 26 treesize of output 80 [2019-11-25 17:18:51,119 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,175 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2019-11-25 17:18:51,176 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:51,260 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 15 [2019-11-25 17:18:51,286 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,325 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-25 17:18:51,326 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-11-25 17:18:51,348 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 72 [2019-11-25 17:18:51,431 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-25 17:18:51,493 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 67 [2019-11-25 17:18:51,578 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:18:51,620 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 67 [2019-11-25 17:18:51,705 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,786 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 67 [2019-11-25 17:18:51,787 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,815 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,822 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:18:51,823 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:18:51,864 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,900 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:51,919 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,940 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,954 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:51,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-25 17:18:51,955 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:51,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,978 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:51,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:51,990 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:52,010 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2019-11-25 17:18:52,034 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,052 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-25 17:18:52,065 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,094 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-25 17:18:52,102 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 110 [2019-11-25 17:18:52,231 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,282 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 75 [2019-11-25 17:18:52,322 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,350 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,378 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:52,379 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,425 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,463 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 41 treesize of output 153 [2019-11-25 17:18:52,560 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,598 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:52,616 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,664 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 67 [2019-11-25 17:18:52,700 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,741 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 48 [2019-11-25 17:18:52,762 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,795 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 48 [2019-11-25 17:18:52,832 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:52,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:18:52,866 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:52,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,907 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:52,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:52,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 102 [2019-11-25 17:18:53,009 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,048 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,066 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:53,067 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 48 [2019-11-25 17:18:53,132 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,149 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:18:53,151 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,192 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2019-11-25 17:18:53,212 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,234 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,241 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:18:53,256 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,274 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2019-11-25 17:18:53,275 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,299 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-25 17:18:53,314 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,335 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,340 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2019-11-25 17:18:53,344 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:53,401 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,425 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:53,468 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,503 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-25 17:18:53,504 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,539 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,540 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2019-11-25 17:18:53,559 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,582 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,593 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:53,615 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2019-11-25 17:18:53,676 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,737 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 110 [2019-11-25 17:18:53,803 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,822 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 48 [2019-11-25 17:18:53,854 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-25 17:18:53,890 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,918 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:18:53,933 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,950 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2019-11-25 17:18:53,953 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:53,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:53,975 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:53,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:53,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:18:53,988 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,018 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 67 [2019-11-25 17:18:54,071 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,092 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,106 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:18:54,106 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,191 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 67 [2019-11-25 17:18:54,192 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,230 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 102 [2019-11-25 17:18:54,312 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,343 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,363 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 67 [2019-11-25 17:18:54,399 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,436 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:18:54,437 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,458 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:18:54,474 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:54,531 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,579 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 75 [2019-11-25 17:18:54,619 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,650 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 67 [2019-11-25 17:18:54,704 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,734 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:18:54,741 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,780 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,818 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 67 [2019-11-25 17:18:54,819 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 75 [2019-11-25 17:18:54,905 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:54,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:18:54,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:54,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:54,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2019-11-25 17:18:54,945 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:55,399 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 16 [2019-11-25 17:18:55,399 INFO L588 ElimStorePlain]: treesize reduction 3673, result has 0.5 percent of original size [2019-11-25 17:18:55,402 INFO L377 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 12 treesize of output 14 [2019-11-25 17:18:55,403 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:55,417 INFO L588 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-25 17:18:55,417 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:18:55,418 INFO L221 ElimStorePlain]: Needed 154 recursive calls to eliminate 8 variables, input treesize:8439, output treesize:14 [2019-11-25 17:18:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:18:55,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:18:55,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2019-11-25 17:18:55,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5964809] [2019-11-25 17:18:55,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-25 17:18:55,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:18:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-25 17:18:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:18:55,498 INFO L87 Difference]: Start difference. First operand 245 states and 333 transitions. Second operand 19 states. [2019-11-25 17:18:56,145 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-11-25 17:19:06,575 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-25 17:19:16,154 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-25 17:19:26,224 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-11-25 17:19:26,514 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-25 17:19:26,717 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-25 17:20:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:20:31,057 INFO L93 Difference]: Finished difference Result 387 states and 520 transitions. [2019-11-25 17:20:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-25 17:20:31,057 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-25 17:20:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:20:31,061 INFO L225 Difference]: With dead ends: 387 [2019-11-25 17:20:31,061 INFO L226 Difference]: Without dead ends: 387 [2019-11-25 17:20:31,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=441, Invalid=1199, Unknown=0, NotChecked=0, Total=1640 [2019-11-25 17:20:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-25 17:20:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 319. [2019-11-25 17:20:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-25 17:20:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 441 transitions. [2019-11-25 17:20:31,076 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 441 transitions. Word has length 35 [2019-11-25 17:20:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:20:31,077 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 441 transitions. [2019-11-25 17:20:31,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-25 17:20:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 441 transitions. [2019-11-25 17:20:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:20:31,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:20:31,078 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:20:31,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:20:31,308 INFO L410 AbstractCegarLoop]: === Iteration 17 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:20:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:20:31,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2659210, now seen corresponding path program 1 times [2019-11-25 17:20:31,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:20:31,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447398471] [2019-11-25 17:20:31,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:20:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 17:20:31,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447398471] [2019-11-25 17:20:31,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992190694] [2019-11-25 17:20:31,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:20:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:31,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-25 17:20:31,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:20:31,905 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_38|], 5=[|v_#valid_53|]} [2019-11-25 17:20:31,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:31,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:31,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:31,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:32,087 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-25 17:20:32,088 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-25 17:20:32,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-25 17:20:32,089 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:32,176 INFO L588 ElimStorePlain]: treesize reduction 50, result has 59.7 percent of original size [2019-11-25 17:20:32,187 INFO L377 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 47 treesize of output 45 [2019-11-25 17:20:32,187 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-25 17:20:32,274 INFO L588 ElimStorePlain]: treesize reduction 26, result has 72.9 percent of original size [2019-11-25 17:20:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,293 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:20:32,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:45, output treesize:70 [2019-11-25 17:20:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:32,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-11-25 17:20:33,009 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2019-11-25 17:20:33,081 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-11-25 17:20:33,126 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-11-25 17:20:33,165 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2019-11-25 17:20:33,181 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,192 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:33,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:33,195 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:33,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:33,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 18 [2019-11-25 17:20:33,203 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,209 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:33,209 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-11-25 17:20:33,244 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2019-11-25 17:20:33,263 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,269 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:33,269 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:33,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:33,293 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:20:33,294 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:33,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2019-11-25 17:20:33,311 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,316 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:33,317 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 17:20:33,324 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,329 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:33,330 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,334 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:33,334 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,338 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:33,338 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,392 INFO L588 ElimStorePlain]: treesize reduction 224, result has 4.7 percent of original size [2019-11-25 17:20:33,392 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:20:33,392 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:669, output treesize:7 [2019-11-25 17:20:33,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:33,837 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-11-25 17:20:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 17:20:33,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:20:33,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2019-11-25 17:20:33,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66127642] [2019-11-25 17:20:33,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 17:20:33,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:20:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 17:20:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:20:33,893 INFO L87 Difference]: Start difference. First operand 319 states and 441 transitions. Second operand 13 states. [2019-11-25 17:20:34,131 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-25 17:20:34,820 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-25 17:20:35,199 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-11-25 17:20:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:20:35,923 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2019-11-25 17:20:35,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:20:35,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-25 17:20:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:20:35,925 INFO L225 Difference]: With dead ends: 331 [2019-11-25 17:20:35,925 INFO L226 Difference]: Without dead ends: 329 [2019-11-25 17:20:35,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:20:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-25 17:20:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2019-11-25 17:20:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-25 17:20:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 436 transitions. [2019-11-25 17:20:35,937 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 436 transitions. Word has length 34 [2019-11-25 17:20:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:20:35,937 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 436 transitions. [2019-11-25 17:20:35,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 17:20:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 436 transitions. [2019-11-25 17:20:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 17:20:35,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:20:35,938 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:20:36,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:20:36,142 INFO L410 AbstractCegarLoop]: === Iteration 18 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:20:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:20:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1559342765, now seen corresponding path program 1 times [2019-11-25 17:20:36,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:20:36,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382682290] [2019-11-25 17:20:36,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:20:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:20:36,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382682290] [2019-11-25 17:20:36,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558225122] [2019-11-25 17:20:36,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:20:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:37,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 17:20:37,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:20:37,182 INFO L377 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 9 treesize of output 3 [2019-11-25 17:20:37,182 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:37,193 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:37,197 INFO L377 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 9 treesize of output 3 [2019-11-25 17:20:37,197 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:37,206 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:37,206 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:20:37,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-25 17:20:37,294 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:37,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:20:37,294 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:37,305 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:37,311 INFO L377 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 16 treesize of output 18 [2019-11-25 17:20:37,312 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:37,325 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:37,326 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:20:37,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-25 17:20:37,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 13 [2019-11-25 17:20:37,422 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:37,433 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:37,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-25 17:20:37,437 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:37,446 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:37,447 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:20:37,447 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-25 17:20:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:20:37,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:20:37,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 26 [2019-11-25 17:20:37,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77450794] [2019-11-25 17:20:37,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-25 17:20:37,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:20:37,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-25 17:20:37,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-11-25 17:20:37,485 INFO L87 Difference]: Start difference. First operand 317 states and 436 transitions. Second operand 27 states. [2019-11-25 17:20:37,777 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-25 17:20:37,968 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2019-11-25 17:20:38,853 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-25 17:20:39,082 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2019-11-25 17:20:39,440 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-25 17:20:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:20:40,641 INFO L93 Difference]: Finished difference Result 361 states and 488 transitions. [2019-11-25 17:20:40,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 17:20:40,642 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-11-25 17:20:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:20:40,645 INFO L225 Difference]: With dead ends: 361 [2019-11-25 17:20:40,645 INFO L226 Difference]: Without dead ends: 361 [2019-11-25 17:20:40,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2019-11-25 17:20:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-25 17:20:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 318. [2019-11-25 17:20:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-25 17:20:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 433 transitions. [2019-11-25 17:20:40,656 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 433 transitions. Word has length 37 [2019-11-25 17:20:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:20:40,657 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 433 transitions. [2019-11-25 17:20:40,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-25 17:20:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 433 transitions. [2019-11-25 17:20:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 17:20:40,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:20:40,658 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:20:40,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:20:40,862 INFO L410 AbstractCegarLoop]: === Iteration 19 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:20:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:20:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1566995341, now seen corresponding path program 1 times [2019-11-25 17:20:40,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:20:40,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7382408] [2019-11-25 17:20:40,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:20:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 17:20:41,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7382408] [2019-11-25 17:20:41,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:20:41,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 17:20:41,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835561175] [2019-11-25 17:20:41,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:20:41,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:20:41,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:20:41,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:20:41,044 INFO L87 Difference]: Start difference. First operand 318 states and 433 transitions. Second operand 9 states. [2019-11-25 17:20:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:20:41,544 INFO L93 Difference]: Finished difference Result 316 states and 409 transitions. [2019-11-25 17:20:41,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:20:41,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-11-25 17:20:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:20:41,546 INFO L225 Difference]: With dead ends: 316 [2019-11-25 17:20:41,547 INFO L226 Difference]: Without dead ends: 316 [2019-11-25 17:20:41,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:20:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-25 17:20:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2019-11-25 17:20:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-25 17:20:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 390 transitions. [2019-11-25 17:20:41,558 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 390 transitions. Word has length 46 [2019-11-25 17:20:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:20:41,559 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 390 transitions. [2019-11-25 17:20:41,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:20:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 390 transitions. [2019-11-25 17:20:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 17:20:41,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:20:41,560 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:20:41,560 INFO L410 AbstractCegarLoop]: === Iteration 20 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:20:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:20:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash -415186385, now seen corresponding path program 1 times [2019-11-25 17:20:41,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:20:41,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262266504] [2019-11-25 17:20:41,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:20:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:20:42,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262266504] [2019-11-25 17:20:42,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620733962] [2019-11-25 17:20:42,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:20:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:20:42,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-25 17:20:42,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:20:42,273 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_40|], 8=[|v_#valid_55|]} [2019-11-25 17:20:42,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:42,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:42,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:42,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:42,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:42,500 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-11-25 17:20:42,501 INFO L343 Elim1Store]: treesize reduction 86, result has 52.7 percent of original size [2019-11-25 17:20:42,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-25 17:20:42,502 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:42,625 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-25 17:20:42,625 INFO L588 ElimStorePlain]: treesize reduction 50, result has 68.6 percent of original size [2019-11-25 17:20:42,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:42,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 75 [2019-11-25 17:20:42,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,648 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-25 17:20:42,793 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-25 17:20:42,794 INFO L588 ElimStorePlain]: treesize reduction 123, result has 44.3 percent of original size [2019-11-25 17:20:42,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,815 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:20:42,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:98 [2019-11-25 17:20:42,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:42,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:43,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:43,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 56 [2019-11-25 17:20:43,400 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:43,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2019-11-25 17:20:43,431 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-11-25 17:20:43,446 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:43,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 31 treesize of output 99 [2019-11-25 17:20:43,537 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:43,548 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:43,556 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:43,569 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:43,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 32 [2019-11-25 17:20:43,570 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:43,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 56 [2019-11-25 17:20:43,623 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,630 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:43,631 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:43,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:43,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 48 [2019-11-25 17:20:43,678 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:43,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:20:43,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:43,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 32 [2019-11-25 17:20:43,707 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-11-25 17:20:43,722 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:43,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:43,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:20:43,745 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,750 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:43,750 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,755 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:20:43,755 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:43,980 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-25 17:20:43,981 INFO L588 ElimStorePlain]: treesize reduction 297, result has 33.0 percent of original size [2019-11-25 17:20:43,982 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-25 17:20:43,982 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:951, output treesize:67 [2019-11-25 17:20:44,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:44,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:45,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:45,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:45,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 158 [2019-11-25 17:20:45,306 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:45,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:45,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:45,372 INFO L377 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 74 [2019-11-25 17:20:45,373 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:45,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:45,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:45,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 112 [2019-11-25 17:20:45,479 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:45,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:45,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:45,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 32 treesize of output 158 [2019-11-25 17:20:45,634 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:45,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:45,806 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-25 17:20:45,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:45,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 32 treesize of output 174 [2019-11-25 17:20:45,809 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:45,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:46,025 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-25 17:20:46,025 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:46,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 37 treesize of output 204 [2019-11-25 17:20:46,027 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:46,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:46,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:46,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 112 [2019-11-25 17:20:46,203 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:46,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:46,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:46,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 112 [2019-11-25 17:20:46,347 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:46,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:46,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:46,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 150 [2019-11-25 17:20:46,510 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:46,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:46,574 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:46,574 INFO L377 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 74 [2019-11-25 17:20:46,575 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:46,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:46,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:46,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 150 [2019-11-25 17:20:46,726 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:46,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:46,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:46,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 112 [2019-11-25 17:20:46,835 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:46,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:20:46,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:46,927 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 104 [2019-11-25 17:20:46,928 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,538 WARN L192 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 95 [2019-11-25 17:20:47,538 INFO L588 ElimStorePlain]: treesize reduction 1326, result has 20.8 percent of original size [2019-11-25 17:20:47,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2019-11-25 17:20:47,547 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2019-11-25 17:20:47,554 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-25 17:20:47,561 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-25 17:20:47,568 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-25 17:20:47,576 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,756 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-25 17:20:47,757 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:47,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2019-11-25 17:20:47,766 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-25 17:20:47,773 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-25 17:20:47,779 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2019-11-25 17:20:47,785 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-25 17:20:47,790 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-25 17:20:47,955 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-25 17:20:47,955 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:20:47,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,978 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 5 xjuncts. [2019-11-25 17:20:47,978 INFO L221 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:795, output treesize:278 [2019-11-25 17:20:47,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:47,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,209 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 64 [2019-11-25 17:20:48,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:20:48,526 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-11-25 17:20:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:20:48,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:20:48,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-11-25 17:20:48,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208951910] [2019-11-25 17:20:48,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 17:20:48,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:20:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 17:20:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:20:48,692 INFO L87 Difference]: Start difference. First operand 301 states and 390 transitions. Second operand 23 states. [2019-11-25 17:20:49,397 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-25 17:20:49,807 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-11-25 17:20:50,208 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-11-25 17:20:50,375 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-25 17:20:50,773 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-11-25 17:20:52,308 WARN L192 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 141 [2019-11-25 17:21:08,880 WARN L192 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 226 DAG size of output: 184 [2019-11-25 17:21:13,375 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-25 17:21:17,530 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 139 [2019-11-25 17:21:38,700 WARN L192 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 217 DAG size of output: 180 [2019-11-25 17:22:01,678 WARN L192 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-11-25 17:22:02,281 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 148 [2019-11-25 17:22:09,233 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2019-11-25 17:22:14,775 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-25 17:22:17,217 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2019-11-25 17:22:31,900 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2019-11-25 17:22:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:22:33,373 INFO L93 Difference]: Finished difference Result 385 states and 454 transitions. [2019-11-25 17:22:33,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-25 17:22:33,374 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-25 17:22:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:22:33,375 INFO L225 Difference]: With dead ends: 385 [2019-11-25 17:22:33,375 INFO L226 Difference]: Without dead ends: 385 [2019-11-25 17:22:33,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=467, Invalid=1496, Unknown=17, NotChecked=0, Total=1980 [2019-11-25 17:22:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-25 17:22:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 334. [2019-11-25 17:22:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-25 17:22:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 410 transitions. [2019-11-25 17:22:33,385 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 410 transitions. Word has length 39 [2019-11-25 17:22:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:22:33,386 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 410 transitions. [2019-11-25 17:22:33,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 17:22:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 410 transitions. [2019-11-25 17:22:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 17:22:33,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:22:33,387 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:22:33,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:33,592 INFO L410 AbstractCegarLoop]: === Iteration 21 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:22:33,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:22:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1604386484, now seen corresponding path program 1 times [2019-11-25 17:22:33,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:22:33,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318637175] [2019-11-25 17:22:33,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:22:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:22:34,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318637175] [2019-11-25 17:22:34,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678615663] [2019-11-25 17:22:34,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:34,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-25 17:22:34,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:22:34,602 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_42|], 15=[|v_#valid_56|]} [2019-11-25 17:22:34,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,683 INFO L343 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2019-11-25 17:22:34,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 37 [2019-11-25 17:22:34,684 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:34,732 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:34,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:34,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:34,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 172 [2019-11-25 17:22:34,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:34,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:34,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:34,767 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:34,878 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-11-25 17:22:34,879 INFO L588 ElimStorePlain]: treesize reduction 247, result has 29.6 percent of original size [2019-11-25 17:22:34,880 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:22:34,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:104 [2019-11-25 17:22:35,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:35,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 76 [2019-11-25 17:22:35,005 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:35,037 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:35,038 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:22:35,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:53 [2019-11-25 17:22:35,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:22:35,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:35,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 168 [2019-11-25 17:22:35,724 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:35,875 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-25 17:22:35,875 INFO L588 ElimStorePlain]: treesize reduction 50, result has 72.8 percent of original size [2019-11-25 17:22:35,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,882 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:22:35,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:107, output treesize:134 [2019-11-25 17:22:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:36,404 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-25 17:22:37,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:22:37,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2019-11-25 17:22:37,088 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:37,227 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-25 17:22:37,228 INFO L588 ElimStorePlain]: treesize reduction 28, result has 84.3 percent of original size [2019-11-25 17:22:37,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-25 17:22:37,247 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:37,307 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:37,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2019-11-25 17:22:37,311 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:37,362 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:37,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-25 17:22:37,368 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:37,410 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:37,411 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-25 17:22:37,412 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:208, output treesize:84 [2019-11-25 17:22:37,783 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-25 17:22:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:22:37,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:22:37,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 27 [2019-11-25 17:22:37,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132433093] [2019-11-25 17:22:37,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-25 17:22:37,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:22:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-25 17:22:37,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-11-25 17:22:37,818 INFO L87 Difference]: Start difference. First operand 334 states and 410 transitions. Second operand 28 states. [2019-11-25 17:22:38,101 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-25 17:22:38,388 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-11-25 17:22:38,806 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-11-25 17:22:39,247 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-25 17:22:39,523 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-11-25 17:22:39,790 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-25 17:22:40,435 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-11-25 17:22:40,915 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-25 17:22:41,274 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-25 17:22:41,750 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2019-11-25 17:22:42,346 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 129 [2019-11-25 17:22:43,011 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 144 [2019-11-25 17:22:43,853 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 144 [2019-11-25 17:22:44,473 WARN L192 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-11-25 17:22:44,863 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 138 [2019-11-25 17:22:45,610 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-11-25 17:22:46,235 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-25 17:22:47,167 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-25 17:22:47,424 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-11-25 17:22:47,876 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-25 17:22:48,156 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-25 17:22:48,672 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-11-25 17:22:49,312 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-11-25 17:22:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:22:49,781 INFO L93 Difference]: Finished difference Result 408 states and 478 transitions. [2019-11-25 17:22:49,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-25 17:22:49,782 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-25 17:22:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:22:49,785 INFO L225 Difference]: With dead ends: 408 [2019-11-25 17:22:49,785 INFO L226 Difference]: Without dead ends: 408 [2019-11-25 17:22:49,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=751, Invalid=2669, Unknown=2, NotChecked=0, Total=3422 [2019-11-25 17:22:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-25 17:22:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 333. [2019-11-25 17:22:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-25 17:22:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 406 transitions. [2019-11-25 17:22:49,797 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 406 transitions. Word has length 45 [2019-11-25 17:22:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:22:49,798 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 406 transitions. [2019-11-25 17:22:49,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-25 17:22:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 406 transitions. [2019-11-25 17:22:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 17:22:49,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:22:49,799 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:22:50,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:50,008 INFO L410 AbstractCegarLoop]: === Iteration 22 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:22:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:22:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1186742862, now seen corresponding path program 1 times [2019-11-25 17:22:50,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:22:50,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940233678] [2019-11-25 17:22:50,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:22:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:22:50,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940233678] [2019-11-25 17:22:50,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378388724] [2019-11-25 17:22:50,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 17:22:50,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:22:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:22:50,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:22:50,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 5 [2019-11-25 17:22:50,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120887674] [2019-11-25 17:22:50,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:22:50,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:22:50,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:22:50,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:22:50,329 INFO L87 Difference]: Start difference. First operand 333 states and 406 transitions. Second operand 6 states. [2019-11-25 17:22:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:22:50,608 INFO L93 Difference]: Finished difference Result 345 states and 417 transitions. [2019-11-25 17:22:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:22:50,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-25 17:22:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:22:50,613 INFO L225 Difference]: With dead ends: 345 [2019-11-25 17:22:50,613 INFO L226 Difference]: Without dead ends: 345 [2019-11-25 17:22:50,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:22:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-25 17:22:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 332. [2019-11-25 17:22:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-25 17:22:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 404 transitions. [2019-11-25 17:22:50,621 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 404 transitions. Word has length 50 [2019-11-25 17:22:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:22:50,622 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 404 transitions. [2019-11-25 17:22:50,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:22:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 404 transitions. [2019-11-25 17:22:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 17:22:50,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:22:50,623 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:22:50,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:50,827 INFO L410 AbstractCegarLoop]: === Iteration 23 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:22:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:22:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1865676899, now seen corresponding path program 1 times [2019-11-25 17:22:50,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:22:50,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779283654] [2019-11-25 17:22:50,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:22:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:22:50,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779283654] [2019-11-25 17:22:50,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001531080] [2019-11-25 17:22:50,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:51,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 17:22:51,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:22:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:22:51,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:22:51,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 5 [2019-11-25 17:22:51,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185439724] [2019-11-25 17:22:51,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:22:51,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:22:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:22:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:22:51,166 INFO L87 Difference]: Start difference. First operand 332 states and 404 transitions. Second operand 6 states. [2019-11-25 17:22:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:22:51,511 INFO L93 Difference]: Finished difference Result 344 states and 415 transitions. [2019-11-25 17:22:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:22:51,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-25 17:22:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:22:51,514 INFO L225 Difference]: With dead ends: 344 [2019-11-25 17:22:51,514 INFO L226 Difference]: Without dead ends: 344 [2019-11-25 17:22:51,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:22:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-25 17:22:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2019-11-25 17:22:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-25 17:22:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 402 transitions. [2019-11-25 17:22:51,523 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 402 transitions. Word has length 51 [2019-11-25 17:22:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:22:51,524 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 402 transitions. [2019-11-25 17:22:51,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:22:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 402 transitions. [2019-11-25 17:22:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 17:22:51,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:22:51,525 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:22:51,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:51,729 INFO L410 AbstractCegarLoop]: === Iteration 24 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:22:51,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:22:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2001408976, now seen corresponding path program 1 times [2019-11-25 17:22:51,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:22:51,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225215361] [2019-11-25 17:22:51,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:22:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:22:51,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225215361] [2019-11-25 17:22:51,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840407700] [2019-11-25 17:22:51,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:52,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-25 17:22:52,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:22:52,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:22:52,037 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:52,038 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:52,039 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:22:52,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:22:52,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:52,059 INFO L377 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-25 17:22:52,060 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:52,079 INFO L588 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-25 17:22:52,080 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:22:52,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-25 17:22:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:22:52,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:22:52,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-25 17:22:52,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687971245] [2019-11-25 17:22:52,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:22:52,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:22:52,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:22:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:22:52,097 INFO L87 Difference]: Start difference. First operand 331 states and 402 transitions. Second operand 7 states. [2019-11-25 17:22:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:22:52,828 INFO L93 Difference]: Finished difference Result 357 states and 421 transitions. [2019-11-25 17:22:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:22:52,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-25 17:22:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:22:52,830 INFO L225 Difference]: With dead ends: 357 [2019-11-25 17:22:52,830 INFO L226 Difference]: Without dead ends: 357 [2019-11-25 17:22:52,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:22:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-25 17:22:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 334. [2019-11-25 17:22:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-25 17:22:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 404 transitions. [2019-11-25 17:22:52,838 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 404 transitions. Word has length 52 [2019-11-25 17:22:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:22:52,838 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 404 transitions. [2019-11-25 17:22:52,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:22:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 404 transitions. [2019-11-25 17:22:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-25 17:22:52,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:22:52,840 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:22:53,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:53,044 INFO L410 AbstractCegarLoop]: === Iteration 25 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:22:53,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:22:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1038016890, now seen corresponding path program 1 times [2019-11-25 17:22:53,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:22:53,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694804936] [2019-11-25 17:22:53,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:22:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-25 17:22:53,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694804936] [2019-11-25 17:22:53,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382864786] [2019-11-25 17:22:53,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:22:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:22:53,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 17:22:53,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:22:53,580 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-25 17:22:53,580 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-25 17:22:53,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-25 17:22:53,581 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:53,634 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-25 17:22:53,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:53,636 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:22:53,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-25 17:22:53,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:53,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:53,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:54,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:54,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:54,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:54,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 31 treesize of output 139 [2019-11-25 17:22:54,587 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,588 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,588 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,589 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,589 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,590 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,590 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,591 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,591 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,591 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,592 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,593 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,593 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,595 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:54,595 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,595 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-25 17:22:54,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:54,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:54,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:54,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 31 treesize of output 139 [2019-11-25 17:22:54,966 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,968 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,968 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,969 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,969 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,971 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,971 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,972 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,972 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,973 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,974 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,975 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:22:54,975 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,976 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:22:54,976 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:22:54,976 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-25 17:22:54,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:55,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:22:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-25 17:22:55,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:22:55,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-25 17:22:55,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936890712] [2019-11-25 17:22:55,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:22:55,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:22:55,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:22:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:22:55,322 INFO L87 Difference]: Start difference. First operand 334 states and 404 transitions. Second operand 12 states. [2019-11-25 17:22:55,684 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-25 17:22:58,174 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-25 17:22:58,351 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-25 17:23:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:23:02,597 INFO L93 Difference]: Finished difference Result 354 states and 419 transitions. [2019-11-25 17:23:02,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:23:02,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-25 17:23:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:23:02,599 INFO L225 Difference]: With dead ends: 354 [2019-11-25 17:23:02,599 INFO L226 Difference]: Without dead ends: 354 [2019-11-25 17:23:02,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:23:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-25 17:23:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 334. [2019-11-25 17:23:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-25 17:23:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 401 transitions. [2019-11-25 17:23:02,609 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 401 transitions. Word has length 54 [2019-11-25 17:23:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:23:02,609 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 401 transitions. [2019-11-25 17:23:02,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:23:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 401 transitions. [2019-11-25 17:23:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 17:23:02,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:23:02,611 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:23:02,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:23:02,815 INFO L410 AbstractCegarLoop]: === Iteration 26 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:23:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:23:02,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2113752430, now seen corresponding path program 1 times [2019-11-25 17:23:02,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:23:02,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272965874] [2019-11-25 17:23:02,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:23:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-25 17:23:02,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272965874] [2019-11-25 17:23:02,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123451359] [2019-11-25 17:23:02,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:23:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:03,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-25 17:23:03,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:23:03,420 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-25 17:23:03,421 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-25 17:23:03,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-25 17:23:03,422 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:03,513 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-25 17:23:03,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,527 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:23:03,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:54 [2019-11-25 17:23:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:03,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:03,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:23:03,761 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:03,811 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:03,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2019-11-25 17:23:03,812 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:03,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:03,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 61 [2019-11-25 17:23:03,864 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:03,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:03,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:23:03,893 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:03,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:03,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:23:03,908 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:03,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:03,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:23:03,935 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:03,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:03,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:23:03,948 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:03,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:03,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:23:04,011 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,021 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 37 [2019-11-25 17:23:04,043 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,053 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-25 17:23:04,062 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,069 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,076 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2019-11-25 17:23:04,077 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:23:04,090 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,099 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,099 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,101 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,106 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 18 [2019-11-25 17:23:04,107 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:23:04,120 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,129 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,130 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,131 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,133 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,139 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,140 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,142 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,143 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,152 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,159 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,160 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,160 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,161 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,162 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,169 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,173 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 7 [2019-11-25 17:23:04,191 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2019-11-25 17:23:04,205 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,211 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,212 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,213 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,215 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,220 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,221 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,224 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,225 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,225 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 7 [2019-11-25 17:23:04,226 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,232 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,232 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,234 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,235 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,235 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,236 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,245 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,245 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,245 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,246 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,246 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 7 [2019-11-25 17:23:04,248 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,254 INFO L377 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 5 treesize of output 3 [2019-11-25 17:23:04,254 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,258 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,258 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,263 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,263 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,269 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,269 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,274 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,274 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,279 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,280 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,284 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,284 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,323 INFO L588 ElimStorePlain]: treesize reduction 143, result has 4.7 percent of original size [2019-11-25 17:23:04,323 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,323 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-25 17:23:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:23:04,561 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:23:04,574 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,602 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-25 17:23:04,603 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:23:04,615 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,625 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-25 17:23:04,635 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,641 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,643 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,643 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2019-11-25 17:23:04,660 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,682 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 18 [2019-11-25 17:23:04,683 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:23:04,696 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,705 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-25 17:23:04,713 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,721 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,722 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,722 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,723 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,732 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,739 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,746 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 18 [2019-11-25 17:23:04,746 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:04,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:23:04,760 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,766 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,769 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,780 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,780 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,781 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,788 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 7 [2019-11-25 17:23:04,791 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,798 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,799 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,799 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,800 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,801 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,801 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,802 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,811 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,820 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 7 [2019-11-25 17:23:04,830 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,837 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,838 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,838 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,841 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,851 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,851 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-11-25 17:23:04,853 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 7 [2019-11-25 17:23:04,863 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,870 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,871 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,871 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-11-25 17:23:04,872 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,880 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2019-11-25 17:23:04,887 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:23:04,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 7 [2019-11-25 17:23:04,895 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,900 INFO L377 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 5 treesize of output 3 [2019-11-25 17:23:04,900 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,905 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,906 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,909 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,909 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,912 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:04,913 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,935 INFO L588 ElimStorePlain]: treesize reduction 75, result has 8.5 percent of original size [2019-11-25 17:23:04,936 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:23:04,936 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-25 17:23:04,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:04,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:05,213 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 17 [2019-11-25 17:23:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-25 17:23:05,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:23:05,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-25 17:23:05,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336245535] [2019-11-25 17:23:05,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:23:05,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:23:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:23:05,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:23:05,255 INFO L87 Difference]: Start difference. First operand 334 states and 401 transitions. Second operand 12 states. [2019-11-25 17:23:05,465 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-25 17:23:06,050 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-11-25 17:23:06,373 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-11-25 17:23:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:23:06,570 INFO L93 Difference]: Finished difference Result 349 states and 415 transitions. [2019-11-25 17:23:06,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:23:06,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-25 17:23:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:23:06,573 INFO L225 Difference]: With dead ends: 349 [2019-11-25 17:23:06,573 INFO L226 Difference]: Without dead ends: 349 [2019-11-25 17:23:06,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-25 17:23:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-25 17:23:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 334. [2019-11-25 17:23:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-25 17:23:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 399 transitions. [2019-11-25 17:23:06,581 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 399 transitions. Word has length 55 [2019-11-25 17:23:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:23:06,582 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 399 transitions. [2019-11-25 17:23:06,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:23:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 399 transitions. [2019-11-25 17:23:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-25 17:23:06,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:23:06,583 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:23:06,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:23:06,788 INFO L410 AbstractCegarLoop]: === Iteration 27 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:23:06,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:23:06,789 INFO L82 PathProgramCache]: Analyzing trace with hash -921542745, now seen corresponding path program 1 times [2019-11-25 17:23:06,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:23:06,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298307543] [2019-11-25 17:23:06,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:23:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 17:23:07,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298307543] [2019-11-25 17:23:07,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292971378] [2019-11-25 17:23:07,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:23:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:07,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-25 17:23:07,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:23:07,281 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_45|], 9=[|v_#valid_60|]} [2019-11-25 17:23:07,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,372 INFO L343 Elim1Store]: treesize reduction 142, result has 12.9 percent of original size [2019-11-25 17:23:07,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 31 [2019-11-25 17:23:07,373 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:07,405 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:07,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:07,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-25 17:23:07,421 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-25 17:23:07,488 INFO L588 ElimStorePlain]: treesize reduction 14, result has 81.6 percent of original size [2019-11-25 17:23:07,489 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:23:07,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:62 [2019-11-25 17:23:07,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:07,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-25 17:23:07,593 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:07,615 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:07,615 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:23:07,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-25 17:23:07,693 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:07,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-25 17:23:07,694 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:07,714 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:07,715 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:23:07,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-25 17:23:08,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:23:08,137 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:08,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 120 [2019-11-25 17:23:08,138 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:08,224 INFO L588 ElimStorePlain]: treesize reduction 34, result has 67.9 percent of original size [2019-11-25 17:23:08,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-25 17:23:08,229 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:08,262 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:08,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-25 17:23:08,266 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:08,297 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:08,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,301 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:23:08,301 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:58 [2019-11-25 17:23:08,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 17:23:08,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:23:08,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2019-11-25 17:23:08,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039089603] [2019-11-25 17:23:08,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 17:23:08,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:23:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 17:23:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:23:08,659 INFO L87 Difference]: Start difference. First operand 334 states and 399 transitions. Second operand 21 states. [2019-11-25 17:23:08,895 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-25 17:23:09,129 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-25 17:23:09,525 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-25 17:23:09,733 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-11-25 17:23:10,176 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-11-25 17:23:10,620 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-11-25 17:23:10,893 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-25 17:23:11,413 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-11-25 17:23:11,770 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2019-11-25 17:23:12,169 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-25 17:23:12,464 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-11-25 17:23:12,890 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-25 17:23:13,353 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-25 17:23:14,406 WARN L192 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-11-25 17:23:14,896 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-25 17:23:15,600 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-25 17:23:17,030 WARN L192 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 151 [2019-11-25 17:23:18,213 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-11-25 17:23:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:23:20,351 INFO L93 Difference]: Finished difference Result 356 states and 416 transitions. [2019-11-25 17:23:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-25 17:23:20,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-11-25 17:23:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:23:20,354 INFO L225 Difference]: With dead ends: 356 [2019-11-25 17:23:20,354 INFO L226 Difference]: Without dead ends: 356 [2019-11-25 17:23:20,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=494, Invalid=1576, Unknown=0, NotChecked=0, Total=2070 [2019-11-25 17:23:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-25 17:23:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 333. [2019-11-25 17:23:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-25 17:23:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 393 transitions. [2019-11-25 17:23:20,362 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 393 transitions. Word has length 60 [2019-11-25 17:23:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:23:20,363 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 393 transitions. [2019-11-25 17:23:20,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 17:23:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 393 transitions. [2019-11-25 17:23:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 17:23:20,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:23:20,364 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:23:20,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:23:20,568 INFO L410 AbstractCegarLoop]: === Iteration 28 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:23:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:23:20,568 INFO L82 PathProgramCache]: Analyzing trace with hash 410180855, now seen corresponding path program 1 times [2019-11-25 17:23:20,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:23:20,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099408926] [2019-11-25 17:23:20,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:23:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:21,161 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-11-25 17:23:21,352 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-11-25 17:23:21,964 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-25 17:23:22,415 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-25 17:23:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 17:23:22,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099408926] [2019-11-25 17:23:22,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952570494] [2019-11-25 17:23:22,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:23:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:23:22,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-25 17:23:22,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:23:22,771 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-25 17:23:22,772 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-25 17:23:22,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-25 17:23:22,773 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:22,825 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-25 17:23:22,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:23:22,827 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:23:22,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-25 17:23:22,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:23:22,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:23:23,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:23:23,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:23:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:23:23,701 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 17:23:23,702 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:23,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-25 17:23:23,703 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:23,820 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:23,821 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 31 treesize of output 139 [2019-11-25 17:23:23,822 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:23,823 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:23,823 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:23,824 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:23,824 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:23,825 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:23,825 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:23,826 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:23,826 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:23,826 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:23:23,827 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:23,833 INFO L588 ElimStorePlain]: treesize reduction 29, result has 9.4 percent of original size [2019-11-25 17:23:23,833 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:23:23,834 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-25 17:23:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:23:24,006 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 17:23:24,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:24,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-25 17:23:24,009 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:24,185 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 17:23:24,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:24,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-25 17:23:24,187 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:24,431 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-25 17:23:24,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:24,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 41 treesize of output 249 [2019-11-25 17:23:24,434 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:24,610 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 17:23:24,611 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:24,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-25 17:23:24,613 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:24,789 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 17:23:24,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:24,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-25 17:23:24,791 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:24,966 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 17:23:24,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:24,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-25 17:23:24,969 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:25,117 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-25 17:23:25,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:25,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 36 treesize of output 190 [2019-11-25 17:23:25,119 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:25,352 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-11-25 17:23:25,353 INFO L588 ElimStorePlain]: treesize reduction 77, result has 62.1 percent of original size [2019-11-25 17:23:25,354 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-25 17:23:25,354 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:261, output treesize:14 [2019-11-25 17:23:25,359 INFO L377 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 5 treesize of output 3 [2019-11-25 17:23:25,359 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:25,363 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:23:25,364 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:23:25,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-25 17:23:25,494 INFO L343 Elim1Store]: treesize reduction 13, result has 79.4 percent of original size [2019-11-25 17:23:25,494 INFO L377 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 4 case distinctions, treesize of input 20 treesize of output 61 [2019-11-25 17:23:25,495 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:23:25,530 INFO L588 ElimStorePlain]: treesize reduction 23, result has 54.9 percent of original size [2019-11-25 17:23:25,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:25,531 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:23:25,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:28 [2019-11-25 17:23:25,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:25,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:25,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:25,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:25,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:25,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:23:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:23:25,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:23:25,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2019-11-25 17:23:25,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089191594] [2019-11-25 17:23:25,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-25 17:23:25,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:23:25,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-25 17:23:25,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-11-25 17:23:25,679 INFO L87 Difference]: Start difference. First operand 333 states and 393 transitions. Second operand 24 states. [2019-11-25 17:24:16,541 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-11-25 17:24:17,402 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-11-25 17:24:18,530 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-11-25 17:25:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:13,894 INFO L93 Difference]: Finished difference Result 354 states and 411 transitions. [2019-11-25 17:25:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 17:25:13,895 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-11-25 17:25:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:13,897 INFO L225 Difference]: With dead ends: 354 [2019-11-25 17:25:13,897 INFO L226 Difference]: Without dead ends: 354 [2019-11-25 17:25:13,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 17:25:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-25 17:25:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 332. [2019-11-25 17:25:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-25 17:25:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 392 transitions. [2019-11-25 17:25:13,905 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 392 transitions. Word has length 64 [2019-11-25 17:25:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:13,906 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 392 transitions. [2019-11-25 17:25:13,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-25 17:25:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 392 transitions. [2019-11-25 17:25:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 17:25:13,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:13,907 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:14,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:14,111 INFO L410 AbstractCegarLoop]: === Iteration 29 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:25:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1152340356, now seen corresponding path program 1 times [2019-11-25 17:25:14,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:14,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804024020] [2019-11-25 17:25:14,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 17:25:14,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804024020] [2019-11-25 17:25:14,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:14,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-25 17:25:14,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090466962] [2019-11-25 17:25:14,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:25:14,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:25:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:25:14,350 INFO L87 Difference]: Start difference. First operand 332 states and 392 transitions. Second operand 11 states. [2019-11-25 17:25:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:15,301 INFO L93 Difference]: Finished difference Result 369 states and 423 transitions. [2019-11-25 17:25:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:25:15,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-11-25 17:25:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:15,304 INFO L225 Difference]: With dead ends: 369 [2019-11-25 17:25:15,304 INFO L226 Difference]: Without dead ends: 356 [2019-11-25 17:25:15,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:25:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-25 17:25:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 328. [2019-11-25 17:25:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-25 17:25:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 379 transitions. [2019-11-25 17:25:15,312 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 379 transitions. Word has length 73 [2019-11-25 17:25:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:15,313 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 379 transitions. [2019-11-25 17:25:15,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:25:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 379 transitions. [2019-11-25 17:25:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 17:25:15,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:15,315 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:15,315 INFO L410 AbstractCegarLoop]: === Iteration 30 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:25:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:15,315 INFO L82 PathProgramCache]: Analyzing trace with hash -169295363, now seen corresponding path program 1 times [2019-11-25 17:25:15,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:15,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589809990] [2019-11-25 17:25:15,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:16,687 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-11-25 17:25:16,947 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-11-25 17:25:17,203 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-11-25 17:25:17,587 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2019-11-25 17:25:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 17:25:17,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589809990] [2019-11-25 17:25:17,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933361325] [2019-11-25 17:25:17,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:17,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-25 17:25:17,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:17,954 INFO L377 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 9 treesize of output 3 [2019-11-25 17:25:17,954 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:17,958 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:17,958 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:17,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-25 17:25:18,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:18,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:25:18,082 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:18,086 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:18,087 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:18,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-25 17:25:18,301 INFO L377 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 9 treesize of output 3 [2019-11-25 17:25:18,301 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:18,308 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:18,308 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:18,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2019-11-25 17:25:18,606 INFO L343 Elim1Store]: treesize reduction 25, result has 74.7 percent of original size [2019-11-25 17:25:18,607 INFO L377 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 4 case distinctions, treesize of input 24 treesize of output 85 [2019-11-25 17:25:18,608 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:18,650 INFO L588 ElimStorePlain]: treesize reduction 35, result has 55.1 percent of original size [2019-11-25 17:25:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:18,651 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:18,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:43 [2019-11-25 17:25:18,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:18,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:18,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:18,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:18,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:18,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:19,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 13 [2019-11-25 17:25:19,075 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:19,085 INFO L588 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-25 17:25:19,085 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:19,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-11-25 17:25:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:19,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:25:19,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 45 [2019-11-25 17:25:19,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660505227] [2019-11-25 17:25:19,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-25 17:25:19,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:19,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-25 17:25:19,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1841, Unknown=0, NotChecked=0, Total=2070 [2019-11-25 17:25:19,142 INFO L87 Difference]: Start difference. First operand 328 states and 379 transitions. Second operand 46 states. [2019-11-25 17:25:19,421 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-25 17:25:19,620 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-11-25 17:25:19,830 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-25 17:25:20,173 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-25 17:25:21,067 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-25 17:25:21,252 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-11-25 17:25:21,477 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-11-25 17:25:21,668 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-25 17:25:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:24,166 INFO L93 Difference]: Finished difference Result 355 states and 401 transitions. [2019-11-25 17:25:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-25 17:25:24,167 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 65 [2019-11-25 17:25:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:24,168 INFO L225 Difference]: With dead ends: 355 [2019-11-25 17:25:24,169 INFO L226 Difference]: Without dead ends: 355 [2019-11-25 17:25:24,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=751, Invalid=3941, Unknown=0, NotChecked=0, Total=4692 [2019-11-25 17:25:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-25 17:25:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 328. [2019-11-25 17:25:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-25 17:25:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 378 transitions. [2019-11-25 17:25:24,179 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 378 transitions. Word has length 65 [2019-11-25 17:25:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:24,180 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 378 transitions. [2019-11-25 17:25:24,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-25 17:25:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 378 transitions. [2019-11-25 17:25:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 17:25:24,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:24,181 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:24,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:24,385 INFO L410 AbstractCegarLoop]: === Iteration 31 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:25:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash 515916095, now seen corresponding path program 1 times [2019-11-25 17:25:24,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:24,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480137078] [2019-11-25 17:25:24,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:25,126 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 31 [2019-11-25 17:25:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:25,948 WARN L192 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 27 [2019-11-25 17:25:26,563 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 34 [2019-11-25 17:25:27,141 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 30 [2019-11-25 17:25:27,938 WARN L192 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 45 [2019-11-25 17:25:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 17:25:28,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480137078] [2019-11-25 17:25:28,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292996006] [2019-11-25 17:25:28,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:28,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-25 17:25:28,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:28,707 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-25 17:25:28,707 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-25 17:25:28,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-25 17:25:28,708 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:28,794 INFO L588 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-11-25 17:25:28,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:28,796 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:28,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:58 [2019-11-25 17:25:28,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:28,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:28,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:28,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:29,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:29,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:29,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 31 treesize of output 139 [2019-11-25 17:25:29,191 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:29,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:29,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 31 treesize of output 131 [2019-11-25 17:25:29,325 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,331 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:25:29,332 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,334 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:25:29,334 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,337 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:25:29,338 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,341 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:25:29,341 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,344 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:25:29,344 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,360 INFO L588 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-11-25 17:25:29,360 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,360 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:271, output treesize:7 [2019-11-25 17:25:29,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:29,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:29,804 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-25 17:25:29,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:29,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 42 treesize of output 314 [2019-11-25 17:25:29,808 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:29,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:30,060 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-25 17:25:30,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:30,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 37 treesize of output 244 [2019-11-25 17:25:30,062 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:30,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:30,310 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-25 17:25:30,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:30,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 37 treesize of output 244 [2019-11-25 17:25:30,313 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:30,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:30,568 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-25 17:25:30,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:30,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 37 treesize of output 244 [2019-11-25 17:25:30,570 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:30,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:30,827 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-25 17:25:30,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:30,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 37 treesize of output 244 [2019-11-25 17:25:30,829 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:30,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:31,087 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-25 17:25:31,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:31,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 37 treesize of output 244 [2019-11-25 17:25:31,090 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:31,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:31,309 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-25 17:25:31,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:31,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 37 treesize of output 244 [2019-11-25 17:25:31,312 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:31,726 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-11-25 17:25:31,726 INFO L588 ElimStorePlain]: treesize reduction 724, result has 26.3 percent of original size [2019-11-25 17:25:31,727 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-25 17:25:31,728 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:306, output treesize:89 [2019-11-25 17:25:31,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:31,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:31,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-25 17:25:31,862 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:31,891 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:31,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:31,928 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:31,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2019-11-25 17:25:31,929 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:31,951 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:31,952 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-25 17:25:31,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:23 [2019-11-25 17:25:32,001 INFO L377 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 5 treesize of output 3 [2019-11-25 17:25:32,002 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:32,005 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:32,006 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:32,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-25 17:25:32,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:32,327 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-25 17:25:32,328 INFO L343 Elim1Store]: treesize reduction 26, result has 82.6 percent of original size [2019-11-25 17:25:32,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 30 treesize of output 140 [2019-11-25 17:25:32,329 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:32,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:32,539 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-25 17:25:32,539 INFO L343 Elim1Store]: treesize reduction 26, result has 82.6 percent of original size [2019-11-25 17:25:32,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 30 treesize of output 140 [2019-11-25 17:25:32,541 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:32,722 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-11-25 17:25:32,722 INFO L588 ElimStorePlain]: treesize reduction 120, result has 39.7 percent of original size [2019-11-25 17:25:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,725 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-25 17:25:32,725 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:79 [2019-11-25 17:25:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:32,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:33,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:25:33,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 32 [2019-11-25 17:25:33,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629594563] [2019-11-25 17:25:33,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-25 17:25:33,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-25 17:25:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2019-11-25 17:25:33,014 INFO L87 Difference]: Start difference. First operand 328 states and 378 transitions. Second operand 33 states. [2019-11-25 17:25:33,257 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-11-25 17:25:33,635 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2019-11-25 17:25:33,983 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2019-11-25 17:25:34,418 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-25 17:25:35,545 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-11-25 17:25:35,906 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-11-25 17:25:36,420 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-11-25 17:25:36,742 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-25 17:25:37,151 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-11-25 17:25:37,432 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-11-25 17:25:37,707 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-11-25 17:25:38,522 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-11-25 17:25:38,825 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-11-25 17:25:39,289 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-11-25 17:25:39,543 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-11-25 17:25:40,267 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-11-25 17:25:40,756 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-25 17:25:41,289 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-25 17:25:41,582 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-11-25 17:25:42,047 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-25 17:25:42,385 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2019-11-25 17:25:42,739 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 110 [2019-11-25 17:25:43,232 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 111 [2019-11-25 17:25:43,541 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-11-25 17:25:43,907 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-11-25 17:25:44,192 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-11-25 17:25:44,635 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-11-25 17:25:44,965 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-11-25 17:25:45,629 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-25 17:25:46,123 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-11-25 17:25:46,420 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-11-25 17:25:46,920 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-11-25 17:25:48,740 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-11-25 17:25:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:49,637 INFO L93 Difference]: Finished difference Result 357 states and 402 transitions. [2019-11-25 17:25:49,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-25 17:25:49,638 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-11-25 17:25:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:49,640 INFO L225 Difference]: With dead ends: 357 [2019-11-25 17:25:49,641 INFO L226 Difference]: Without dead ends: 357 [2019-11-25 17:25:49,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=827, Invalid=4575, Unknown=0, NotChecked=0, Total=5402 [2019-11-25 17:25:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-25 17:25:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 332. [2019-11-25 17:25:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-25 17:25:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 382 transitions. [2019-11-25 17:25:49,648 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 382 transitions. Word has length 67 [2019-11-25 17:25:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:49,649 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 382 transitions. [2019-11-25 17:25:49,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-25 17:25:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 382 transitions. [2019-11-25 17:25:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 17:25:49,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:49,650 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:49,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:49,854 INFO L410 AbstractCegarLoop]: === Iteration 32 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:25:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:49,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1478886374, now seen corresponding path program 1 times [2019-11-25 17:25:49,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:49,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816982003] [2019-11-25 17:25:49,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 17:25:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 17:25:49,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 17:25:49,979 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 17:25:50,037 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-25 17:25:50,055 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## [2019-11-25 17:25:50,056 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## [2019-11-25 17:25:50,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:25:50 BoogieIcfgContainer [2019-11-25 17:25:50,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:25:50,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:25:50,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:25:50,113 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:25:50,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:16:57" (3/4) ... [2019-11-25 17:25:50,119 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 17:25:50,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:25:50,120 INFO L168 Benchmark]: Toolchain (without parser) took 533857.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -108.5 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:25:50,120 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:25:50,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:25:50,121 INFO L168 Benchmark]: Boogie Preprocessor took 79.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:25:50,121 INFO L168 Benchmark]: RCFGBuilder took 878.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:25:50,121 INFO L168 Benchmark]: TraceAbstraction took 532235.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -18.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-25 17:25:50,121 INFO L168 Benchmark]: Witness Printer took 6.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:25:50,122 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 878.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 532235.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -18.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 104 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 102 could not be translated for associated CType ARRAY#_2_~STRUCT~~command?name~*CHAR?function~*(() : VOID)?state_needed~CHAR## * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [\old(commands)=null, \old(commands)=null, \old(global)=120, \old(global)=117, \old(state)=109, commands={7:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={4:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={4:0}, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={4:0}, input={4:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={4:0}, input={4:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={4:0}, input={4:0}, state=0] [L722] RET parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L723] CALL parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={9:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={9:0}, input={9:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={5:0}, global={0:0}, i=1, input={9:0}, input={9:0}, state=0] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={9:0}, input={9:0}, state=0] [L692] COND FALSE !(i < 2) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=2, input={9:0}, input={9:0}, state=0] [L723] RET parse_input("c1") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L724] CALL parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, input={10:0}, state=0] [L692] int i = 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR commands[i].name VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].name={6:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].state_needed=0, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={0:0}, i=0, input={10:0}, input={10:0}, state=0] [L695] CALL commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, state=0] [L702] char *x = (char *)malloc(sizeof(char)); VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L703] COND FALSE !(!x) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={0:0}, malloc(sizeof(char))={1:0}, state=0, x={1:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, malloc(sizeof(char))={1:0}, state=1, x={1:0}] [L695] RET commands[i].function() VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, commands[i].function={-1:0}, global={1:0}, i=0, input={10:0}, input={10:0}, state=1] [L724] RET parse_input("c2") VAL [\old(global)=0, \old(global)=0, \old(state)=0, commands={7:0}, global={1:0}, state=1] [L725] return 0; VAL [\old(global)=0, \old(global)=0, \old(state)=0, \result=0, commands={7:0}, global={1:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 79 locations, 20 error locations. Result: UNSAFE, OverallTime: 532.1s, OverallIterations: 32, TraceHistogramMax: 5, AutomataDifference: 448.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1564 SDtfs, 10662 SDslu, 2859 SDs, 0 SdLazy, 15850 SolverSat, 4086 SolverUnsat, 85 SolverUnknown, 0 SolverNotchecked, 201.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1497 GetRequests, 790 SyntacticMatches, 83 SemanticMatches, 624 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6484 ImplicationChecksByTransitivity, 164.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 880 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 75.3s InterpolantComputationTime, 1977 NumberOfCodeBlocks, 1977 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1853 ConstructedInterpolants, 250 QuantifiedInterpolants, 1750916 SizeOfPredicates, 206 NumberOfNonLiveVariables, 6738 ConjunctsInSsa, 542 ConjunctsInUnsatCore, 49 InterpolantComputations, 13 PerfectInterpolantSequences, 541/983 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6692e4f [2019-11-25 17:25:52,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:25:52,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:25:52,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:25:52,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:25:52,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:25:52,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:25:52,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:25:52,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:25:52,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:25:52,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:25:52,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:25:52,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:25:52,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:25:52,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:25:52,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:25:52,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:25:52,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:25:52,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:25:52,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:25:52,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:25:52,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:25:52,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:25:52,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:25:52,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:25:52,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:25:52,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:25:52,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:25:52,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:25:52,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:25:52,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:25:52,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:25:52,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:25:52,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:25:52,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:25:52,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:25:52,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:25:52,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:25:52,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:25:52,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:25:52,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:25:52,168 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-25 17:25:52,194 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:25:52,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:25:52,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:25:52,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:25:52,199 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:25:52,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:25:52,200 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:25:52,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:25:52,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:25:52,201 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:25:52,201 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:25:52,201 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:25:52,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:25:52,202 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:25:52,202 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 17:25:52,202 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 17:25:52,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:25:52,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:25:52,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:25:52,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:25:52,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:25:52,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:25:52,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:25:52,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:25:52,205 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 17:25:52,206 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 17:25:52,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 17:25:52,206 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 129dca108ba5ab1702fbcd782a34bbf933adb446 [2019-11-25 17:25:52,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:25:52,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:25:52,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:25:52,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:25:52,522 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:25:52,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-25 17:25:52,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09f2a484/3653fee5b6d340f0b4af4cb2fc187302/FLAG1cdac162f [2019-11-25 17:25:53,142 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:25:53,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-25 17:25:53,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09f2a484/3653fee5b6d340f0b4af4cb2fc187302/FLAG1cdac162f [2019-11-25 17:25:53,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09f2a484/3653fee5b6d340f0b4af4cb2fc187302 [2019-11-25 17:25:53,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:25:53,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:25:53,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:25:53,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:25:53,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:25:53,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:25:53" (1/1) ... [2019-11-25 17:25:53,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bba22f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:53, skipping insertion in model container [2019-11-25 17:25:53,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:25:53" (1/1) ... [2019-11-25 17:25:53,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:25:53,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:25:54,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:25:54,027 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:25:54,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:25:54,153 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:25:54,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54 WrapperNode [2019-11-25 17:25:54,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:25:54,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:25:54,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:25:54,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:25:54,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (1/1) ... [2019-11-25 17:25:54,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (1/1) ... [2019-11-25 17:25:54,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (1/1) ... [2019-11-25 17:25:54,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (1/1) ... [2019-11-25 17:25:54,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (1/1) ... [2019-11-25 17:25:54,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (1/1) ... [2019-11-25 17:25:54,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (1/1) ... [2019-11-25 17:25:54,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:25:54,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:25:54,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:25:54,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:25:54,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:25:54,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:25:54,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:25:54,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-25 17:25:54,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:25:54,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:25:54,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:25:54,294 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-25 17:25:54,294 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-25 17:25:54,294 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-25 17:25:54,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:25:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:25:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:25:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:25:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:25:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:25:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:25:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:25:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:25:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:25:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:25:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:25:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:25:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:25:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:25:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:25:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:25:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:25:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:25:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:25:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:25:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:25:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:25:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:25:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:25:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:25:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:25:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:25:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:25:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:25:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:25:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-25 17:25:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:25:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:25:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:25:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 17:25:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:25:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:25:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 17:25:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:25:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:25:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 17:25:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:25:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:25:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:25:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:25:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:25:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:25:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:25:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:25:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:25:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:25:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:25:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:25:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:25:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:25:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:25:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:25:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:25:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:25:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:25:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:25:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:25:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:25:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:25:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:25:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:25:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:25:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:25:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:25:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:25:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:25:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 17:25:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-25 17:25:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-25 17:25:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 17:25:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-25 17:25:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-25 17:25:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-25 17:25:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-25 17:25:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-25 17:25:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-25 17:25:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-25 17:25:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-25 17:25:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-25 17:25:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-25 17:25:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-25 17:25:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-25 17:25:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-25 17:25:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-25 17:25:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-25 17:25:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-25 17:25:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-25 17:25:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-25 17:25:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-25 17:25:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-25 17:25:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-25 17:25:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-25 17:25:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-25 17:25:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-25 17:25:54,320 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-25 17:25:54,320 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-25 17:25:54,320 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-25 17:25:54,320 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-25 17:25:54,320 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-25 17:25:54,321 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-25 17:25:54,321 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-25 17:25:54,321 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-25 17:25:54,321 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-25 17:25:54,321 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-25 17:25:54,322 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-25 17:25:54,322 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-25 17:25:54,322 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-25 17:25:54,322 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-25 17:25:54,322 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-25 17:25:54,323 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-25 17:25:54,323 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-25 17:25:54,323 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-25 17:25:54,323 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-25 17:25:54,323 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-25 17:25:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-25 17:25:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 17:25:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-25 17:25:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-25 17:25:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:25:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-25 17:25:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:25:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:25:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:25:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:25:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-25 17:25:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 17:25:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:25:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:25:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:25:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-25 17:25:55,081 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:25:55,081 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 17:25:55,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:25:55 BoogieIcfgContainer [2019-11-25 17:25:55,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:25:55,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:25:55,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:25:55,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:25:55,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:25:53" (1/3) ... [2019-11-25 17:25:55,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1525f57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:25:55, skipping insertion in model container [2019-11-25 17:25:55,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:54" (2/3) ... [2019-11-25 17:25:55,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1525f57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:25:55, skipping insertion in model container [2019-11-25 17:25:55,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:25:55" (3/3) ... [2019-11-25 17:25:55,092 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-25 17:25:55,101 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:25:55,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-25 17:25:55,120 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-25 17:25:55,141 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:25:55,142 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:25:55,142 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:25:55,142 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:25:55,143 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:25:55,143 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:25:55,143 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:25:55,144 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:25:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-25 17:25:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 17:25:55,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:55,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:55,174 INFO L410 AbstractCegarLoop]: === Iteration 1 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:25:55,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:55,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-25 17:25:55,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:25:55,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565085326] [2019-11-25 17:25:55,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-25 17:25:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:55,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:25:55,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:55,828 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-25 17:25:55,830 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-25 17:25:55,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-25 17:25:55,833 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:55,933 INFO L588 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-25 17:25:55,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:55,944 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:55,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-25 17:25:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:55,982 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:25:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:56,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565085326] [2019-11-25 17:25:56,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:56,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 17:25:56,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248527193] [2019-11-25 17:25:56,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:25:56,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:25:56,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:25:56,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:25:56,042 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-25 17:25:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:56,224 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-11-25 17:25:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:25:56,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-25 17:25:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:56,241 INFO L225 Difference]: With dead ends: 93 [2019-11-25 17:25:56,241 INFO L226 Difference]: Without dead ends: 87 [2019-11-25 17:25:56,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:25:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-25 17:25:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-25 17:25:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-25 17:25:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-11-25 17:25:56,320 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 9 [2019-11-25 17:25:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:56,320 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-11-25 17:25:56,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:25:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-11-25 17:25:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 17:25:56,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:56,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:56,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 17:25:56,538 INFO L410 AbstractCegarLoop]: === Iteration 2 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:25:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-25 17:25:56,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:25:56,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245337500] [2019-11-25 17:25:56,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-25 17:25:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:56,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 17:25:56,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:57,178 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-25 17:25:57,179 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-25 17:25:57,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-25 17:25:57,181 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:57,323 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-25 17:25:57,324 INFO L588 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-25 17:25:57,328 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:57,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-25 17:25:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:57,363 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:25:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:57,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245337500] [2019-11-25 17:25:57,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:57,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-25 17:25:57,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310488316] [2019-11-25 17:25:57,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:25:57,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:25:57,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:25:57,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:25:57,564 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 6 states. [2019-11-25 17:25:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:58,132 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2019-11-25 17:25:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:25:58,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-25 17:25:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:58,135 INFO L225 Difference]: With dead ends: 172 [2019-11-25 17:25:58,135 INFO L226 Difference]: Without dead ends: 172 [2019-11-25 17:25:58,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:25:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-25 17:25:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2019-11-25 17:25:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-25 17:25:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-11-25 17:25:58,163 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 9 [2019-11-25 17:25:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:58,163 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-11-25 17:25:58,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:25:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-11-25 17:25:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 17:25:58,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:58,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:58,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 17:25:58,365 INFO L410 AbstractCegarLoop]: === Iteration 3 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:25:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-25 17:25:58,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:25:58,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231892739] [2019-11-25 17:25:58,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-25 17:25:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:58,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 17:25:58,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:58,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:58,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:25:59,054 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2019-11-25 17:25:59,056 INFO L343 Elim1Store]: treesize reduction 360, result has 17.4 percent of original size [2019-11-25 17:25:59,056 INFO L377 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 2 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 163 [2019-11-25 17:25:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:59,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:59,063 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:59,305 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-11-25 17:25:59,306 INFO L588 ElimStorePlain]: treesize reduction 181, result has 40.3 percent of original size [2019-11-25 17:25:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:59,328 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:59,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:99, output treesize:122 [2019-11-25 17:25:59,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:59,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:59,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:25:59,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:59,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-25 17:25:59,591 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:59,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:59,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-25 17:25:59,660 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:59,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:59,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-25 17:25:59,716 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:59,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:59,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-25 17:25:59,774 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:59,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:59,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-25 17:25:59,831 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:59,891 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:59,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-25 17:25:59,893 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:59,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:59,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2019-11-25 17:25:59,957 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:00,552 WARN L192 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-11-25 17:26:00,556 INFO L588 ElimStorePlain]: treesize reduction 279, result has 61.8 percent of original size [2019-11-25 17:26:00,560 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-11-25 17:26:00,561 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:730, output treesize:451 [2019-11-25 17:26:00,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 23 [2019-11-25 17:26:00,805 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:00,848 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:00,849 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:00,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:56 [2019-11-25 17:26:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:00,896 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:01,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231892739] [2019-11-25 17:26:01,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:01,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-25 17:26:01,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436177580] [2019-11-25 17:26:01,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:26:01,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:01,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:26:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:26:01,264 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 9 states. [2019-11-25 17:26:02,002 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-11-25 17:26:02,379 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2019-11-25 17:26:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:03,231 INFO L93 Difference]: Finished difference Result 260 states and 372 transitions. [2019-11-25 17:26:03,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:26:03,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-25 17:26:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:03,237 INFO L225 Difference]: With dead ends: 260 [2019-11-25 17:26:03,237 INFO L226 Difference]: Without dead ends: 260 [2019-11-25 17:26:03,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:26:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-25 17:26:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 213. [2019-11-25 17:26:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-25 17:26:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2019-11-25 17:26:03,289 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 10 [2019-11-25 17:26:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:03,289 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2019-11-25 17:26:03,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:26:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2019-11-25 17:26:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 17:26:03,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:03,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:03,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 17:26:03,495 INFO L410 AbstractCegarLoop]: === Iteration 4 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:03,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-25 17:26:03,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:03,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096385725] [2019-11-25 17:26:03,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:03,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-25 17:26:03,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:03,720 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_52|], 8=[|v_#valid_69|]} [2019-11-25 17:26:03,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:03,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:03,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:03,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:03,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:03,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:03,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:04,038 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-11-25 17:26:04,038 INFO L343 Elim1Store]: treesize reduction 48, result has 70.0 percent of original size [2019-11-25 17:26:04,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 117 [2019-11-25 17:26:04,040 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:04,268 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-11-25 17:26:04,269 INFO L588 ElimStorePlain]: treesize reduction 58, result has 70.1 percent of original size [2019-11-25 17:26:04,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:04,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 199 [2019-11-25 17:26:04,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,327 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:04,640 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-11-25 17:26:04,641 INFO L588 ElimStorePlain]: treesize reduction 496, result has 20.1 percent of original size [2019-11-25 17:26:04,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,649 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:04,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:103, output treesize:125 [2019-11-25 17:26:04,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,802 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-25 17:26:04,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:04,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:04,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:26:04,893 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:04,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:04,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-25 17:26:04,917 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:04,935 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:04,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-25 17:26:04,937 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:04,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:04,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-25 17:26:04,968 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:04,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:04,988 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:04,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-25 17:26:04,990 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:05,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:05,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-25 17:26:05,004 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:05,365 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-25 17:26:05,365 INFO L588 ElimStorePlain]: treesize reduction 211, result has 51.3 percent of original size [2019-11-25 17:26:05,368 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2019-11-25 17:26:05,369 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:515, output treesize:222 [2019-11-25 17:26:05,563 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-11-25 17:26:05,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:05,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-25 17:26:05,757 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:05,865 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-25 17:26:05,866 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:05,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 19 [2019-11-25 17:26:05,876 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:05,956 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:05,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-25 17:26:05,966 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:06,038 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:06,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-25 17:26:06,047 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:06,113 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:06,115 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-25 17:26:06,115 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:138, output treesize:83 [2019-11-25 17:26:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:06,180 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:06,446 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-25 17:26:06,607 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-25 17:26:06,812 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-25 17:26:06,968 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-25 17:26:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:06,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096385725] [2019-11-25 17:26:06,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:06,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-25 17:26:06,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755421946] [2019-11-25 17:26:06,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:26:06,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:26:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:26:06,984 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand 9 states. [2019-11-25 17:26:07,270 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-11-25 17:26:07,597 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2019-11-25 17:26:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:09,064 INFO L93 Difference]: Finished difference Result 394 states and 571 transitions. [2019-11-25 17:26:09,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:26:09,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-25 17:26:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:09,071 INFO L225 Difference]: With dead ends: 394 [2019-11-25 17:26:09,071 INFO L226 Difference]: Without dead ends: 394 [2019-11-25 17:26:09,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-25 17:26:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-25 17:26:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 319. [2019-11-25 17:26:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-25 17:26:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 505 transitions. [2019-11-25 17:26:09,109 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 505 transitions. Word has length 11 [2019-11-25 17:26:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:09,109 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 505 transitions. [2019-11-25 17:26:09,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:26:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 505 transitions. [2019-11-25 17:26:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 17:26:09,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:09,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:09,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 17:26:09,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-25 17:26:09,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:09,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55732891] [2019-11-25 17:26:09,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:09,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 17:26:09,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:09,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:09,838 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2019-11-25 17:26:09,839 INFO L343 Elim1Store]: treesize reduction 336, result has 15.2 percent of original size [2019-11-25 17:26:09,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 119 [2019-11-25 17:26:09,841 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:09,984 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-11-25 17:26:09,985 INFO L588 ElimStorePlain]: treesize reduction 49, result has 62.9 percent of original size [2019-11-25 17:26:09,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:09,989 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:09,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:83 [2019-11-25 17:26:09,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:10,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:10,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:10,369 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:10,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:10,371 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:10,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:10,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:10,393 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:10,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:10,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:10,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2019-11-25 17:26:10,404 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:10,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:10,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:10,431 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:10,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:10,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:10,451 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:10,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:10,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:10,472 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:10,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:10,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:10,496 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:10,957 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-25 17:26:10,958 INFO L588 ElimStorePlain]: treesize reduction 100, result has 76.8 percent of original size [2019-11-25 17:26:10,961 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-11-25 17:26:10,961 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:478, output treesize:331 [2019-11-25 17:26:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:11,104 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:11,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55732891] [2019-11-25 17:26:11,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:11,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-25 17:26:11,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141126790] [2019-11-25 17:26:11,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:26:11,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:11,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:26:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:26:11,389 INFO L87 Difference]: Start difference. First operand 319 states and 505 transitions. Second operand 9 states. [2019-11-25 17:26:14,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:14,830 INFO L93 Difference]: Finished difference Result 411 states and 618 transitions. [2019-11-25 17:26:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:26:14,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-11-25 17:26:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:14,836 INFO L225 Difference]: With dead ends: 411 [2019-11-25 17:26:14,836 INFO L226 Difference]: Without dead ends: 411 [2019-11-25 17:26:14,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:26:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-25 17:26:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 363. [2019-11-25 17:26:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-25 17:26:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 569 transitions. [2019-11-25 17:26:14,867 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 569 transitions. Word has length 12 [2019-11-25 17:26:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:14,868 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 569 transitions. [2019-11-25 17:26:14,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:26:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 569 transitions. [2019-11-25 17:26:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 17:26:14,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:14,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:15,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 17:26:15,084 INFO L410 AbstractCegarLoop]: === Iteration 6 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-25 17:26:15,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:15,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075010558] [2019-11-25 17:26:15,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:15,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 17:26:15,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:15,272 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_65|], 4=[|v_#valid_85|]} [2019-11-25 17:26:15,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:15,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:15,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:15,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:15,572 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-25 17:26:15,572 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-25 17:26:15,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-25 17:26:15,574 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:15,750 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-25 17:26:15,751 INFO L588 ElimStorePlain]: treesize reduction 50, result has 64.0 percent of original size [2019-11-25 17:26:15,765 INFO L377 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 97 treesize of output 93 [2019-11-25 17:26:15,766 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:15,955 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-25 17:26:15,956 INFO L588 ElimStorePlain]: treesize reduction 64, result has 56.8 percent of original size [2019-11-25 17:26:15,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,978 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:15,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:60, output treesize:84 [2019-11-25 17:26:15,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:15,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:16,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:16,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2019-11-25 17:26:16,393 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:16,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:16,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-25 17:26:16,419 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,428 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:26:16,429 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:16,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-25 17:26:16,458 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,468 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:26:16,468 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,483 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,485 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 9 [2019-11-25 17:26:16,487 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:16,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-25 17:26:16,515 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,539 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:16,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2019-11-25 17:26:16,550 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:16,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:16,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-25 17:26:16,578 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,589 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:26:16,589 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:16,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-25 17:26:16,607 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2019-11-25 17:26:16,629 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,650 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 9 [2019-11-25 17:26:16,652 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 9 [2019-11-25 17:26:16,676 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,694 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 9 [2019-11-25 17:26:16,696 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,705 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:26:16,705 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,713 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:26:16,714 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:16,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:16,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 9 [2019-11-25 17:26:16,727 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:17,103 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-11-25 17:26:17,104 INFO L588 ElimStorePlain]: treesize reduction 342, result has 38.2 percent of original size [2019-11-25 17:26:17,106 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2019-11-25 17:26:17,106 INFO L221 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:1046, output treesize:211 [2019-11-25 17:26:17,233 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 25 [2019-11-25 17:26:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:17,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:17,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075010558] [2019-11-25 17:26:17,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:17,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-25 17:26:17,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033842649] [2019-11-25 17:26:17,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:26:17,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:26:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:26:17,616 INFO L87 Difference]: Start difference. First operand 363 states and 569 transitions. Second operand 9 states. [2019-11-25 17:26:17,814 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-25 17:26:18,030 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-11-25 17:26:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:19,498 INFO L93 Difference]: Finished difference Result 425 states and 598 transitions. [2019-11-25 17:26:19,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:26:19,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-11-25 17:26:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:19,504 INFO L225 Difference]: With dead ends: 425 [2019-11-25 17:26:19,505 INFO L226 Difference]: Without dead ends: 425 [2019-11-25 17:26:19,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:26:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-25 17:26:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 367. [2019-11-25 17:26:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-25 17:26:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 569 transitions. [2019-11-25 17:26:19,555 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 569 transitions. Word has length 13 [2019-11-25 17:26:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:19,557 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 569 transitions. [2019-11-25 17:26:19,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:26:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 569 transitions. [2019-11-25 17:26:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 17:26:19,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:19,558 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:19,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 17:26:19,774 INFO L410 AbstractCegarLoop]: === Iteration 7 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2063492765, now seen corresponding path program 1 times [2019-11-25 17:26:19,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:19,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558042708] [2019-11-25 17:26:19,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:19,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 17:26:19,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:19,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:20,276 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 44 [2019-11-25 17:26:20,277 INFO L343 Elim1Store]: treesize reduction 429, result has 15.7 percent of original size [2019-11-25 17:26:20,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 237 treesize of output 279 [2019-11-25 17:26:20,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:20,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:20,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:20,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:20,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:20,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:20,283 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:20,587 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2019-11-25 17:26:20,587 INFO L588 ElimStorePlain]: treesize reduction 491, result has 20.7 percent of original size [2019-11-25 17:26:20,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:20,591 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:20,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:102, output treesize:128 [2019-11-25 17:26:20,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:20,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:20,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:20,817 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:20,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-25 17:26:20,818 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:20,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:20,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:20,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2019-11-25 17:26:20,831 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:20,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:20,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-25 17:26:20,862 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:20,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:20,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-25 17:26:20,893 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:20,931 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:20,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-25 17:26:20,932 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:20,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:20,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-25 17:26:20,959 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:20,974 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:20,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2019-11-25 17:26:20,975 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:21,583 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-25 17:26:21,584 INFO L588 ElimStorePlain]: treesize reduction 225, result has 67.7 percent of original size [2019-11-25 17:26:21,586 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-11-25 17:26:21,587 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:760, output treesize:471 [2019-11-25 17:26:21,795 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 46 [2019-11-25 17:26:22,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 21 [2019-11-25 17:26:22,032 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:22,097 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:22,099 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:22,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:63 [2019-11-25 17:26:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:22,197 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:22,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558042708] [2019-11-25 17:26:22,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:22,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-25 17:26:22,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376595590] [2019-11-25 17:26:22,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:26:22,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:26:22,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:26:22,669 INFO L87 Difference]: Start difference. First operand 367 states and 569 transitions. Second operand 11 states. [2019-11-25 17:26:23,674 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-11-25 17:26:24,659 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-11-25 17:26:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:26,421 INFO L93 Difference]: Finished difference Result 478 states and 729 transitions. [2019-11-25 17:26:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:26:26,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-25 17:26:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:26,425 INFO L225 Difference]: With dead ends: 478 [2019-11-25 17:26:26,426 INFO L226 Difference]: Without dead ends: 478 [2019-11-25 17:26:26,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-25 17:26:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-25 17:26:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 386. [2019-11-25 17:26:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-11-25 17:26:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 599 transitions. [2019-11-25 17:26:26,455 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 599 transitions. Word has length 18 [2019-11-25 17:26:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:26,455 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 599 transitions. [2019-11-25 17:26:26,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:26:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 599 transitions. [2019-11-25 17:26:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 17:26:26,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:26,457 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:26,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 17:26:26,670 INFO L410 AbstractCegarLoop]: === Iteration 8 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-25 17:26:26,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:26,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798443805] [2019-11-25 17:26:26,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:26,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 17:26:26,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:26,929 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_78|], 9=[|v_#valid_101|]} [2019-11-25 17:26:26,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:26,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:26,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:26,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:26,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:26,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:26,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:27,272 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-25 17:26:27,273 INFO L343 Elim1Store]: treesize reduction 63, result has 65.6 percent of original size [2019-11-25 17:26:27,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-25 17:26:27,275 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:27,515 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-25 17:26:27,516 INFO L588 ElimStorePlain]: treesize reduction 62, result has 70.9 percent of original size [2019-11-25 17:26:27,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:27,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 138 [2019-11-25 17:26:27,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,559 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:27,860 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-25 17:26:27,860 INFO L588 ElimStorePlain]: treesize reduction 171, result has 45.2 percent of original size [2019-11-25 17:26:27,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,869 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:27,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:141 [2019-11-25 17:26:27,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:27,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:28,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:28,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:28,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2019-11-25 17:26:28,116 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:28,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:28,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-25 17:26:28,144 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-25 17:26:28,166 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:28,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:28,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-25 17:26:28,196 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:28,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:28,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2019-11-25 17:26:28,238 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:28,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:28,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-25 17:26:28,259 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:28,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:28,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-25 17:26:28,282 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:28,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2019-11-25 17:26:28,304 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,313 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:26:28,313 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,321 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:26:28,321 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,328 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:26:28,329 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:28,756 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-11-25 17:26:28,757 INFO L588 ElimStorePlain]: treesize reduction 441, result has 37.4 percent of original size [2019-11-25 17:26:28,759 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2019-11-25 17:26:28,759 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:1266, output treesize:263 [2019-11-25 17:26:28,933 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-11-25 17:26:29,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:26:29,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-11-25 17:26:29,299 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:29,386 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:29,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-25 17:26:29,395 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:29,475 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:29,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-25 17:26:29,484 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:29,553 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:29,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-25 17:26:29,562 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:29,624 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:29,625 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-25 17:26:29,625 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:128, output treesize:75 [2019-11-25 17:26:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:29,702 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:30,156 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-25 17:26:30,258 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-25 17:26:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:30,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798443805] [2019-11-25 17:26:30,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:30,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-25 17:26:30,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949500233] [2019-11-25 17:26:30,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:26:30,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:30,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:26:30,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:26:30,286 INFO L87 Difference]: Start difference. First operand 386 states and 599 transitions. Second operand 11 states. [2019-11-25 17:26:30,785 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-11-25 17:26:31,158 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-11-25 17:26:31,467 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-11-25 17:26:31,892 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-11-25 17:26:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:34,955 INFO L93 Difference]: Finished difference Result 519 states and 763 transitions. [2019-11-25 17:26:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:26:34,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-25 17:26:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:34,960 INFO L225 Difference]: With dead ends: 519 [2019-11-25 17:26:34,960 INFO L226 Difference]: Without dead ends: 519 [2019-11-25 17:26:34,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:26:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-11-25 17:26:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 424. [2019-11-25 17:26:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-25 17:26:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 664 transitions. [2019-11-25 17:26:34,981 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 664 transitions. Word has length 19 [2019-11-25 17:26:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:34,982 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 664 transitions. [2019-11-25 17:26:34,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:26:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 664 transitions. [2019-11-25 17:26:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 17:26:34,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:34,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:35,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 17:26:35,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:35,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1646608229, now seen corresponding path program 1 times [2019-11-25 17:26:35,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:35,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403156920] [2019-11-25 17:26:35,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:35,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 17:26:35,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:35,375 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:35,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403156920] [2019-11-25 17:26:35,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:35,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 17:26:35,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394804227] [2019-11-25 17:26:35,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:26:35,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:35,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:26:35,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:26:35,382 INFO L87 Difference]: Start difference. First operand 424 states and 664 transitions. Second operand 3 states. [2019-11-25 17:26:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:35,393 INFO L93 Difference]: Finished difference Result 325 states and 478 transitions. [2019-11-25 17:26:35,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:26:35,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 17:26:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:35,396 INFO L225 Difference]: With dead ends: 325 [2019-11-25 17:26:35,396 INFO L226 Difference]: Without dead ends: 325 [2019-11-25 17:26:35,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:26:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-25 17:26:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2019-11-25 17:26:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-25 17:26:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 469 transitions. [2019-11-25 17:26:35,409 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 469 transitions. Word has length 23 [2019-11-25 17:26:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:35,410 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 469 transitions. [2019-11-25 17:26:35,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:26:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 469 transitions. [2019-11-25 17:26:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 17:26:35,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:35,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:35,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 17:26:35,626 INFO L410 AbstractCegarLoop]: === Iteration 10 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -407602741, now seen corresponding path program 1 times [2019-11-25 17:26:35,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:35,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388571650] [2019-11-25 17:26:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:35,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 17:26:35,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:35,817 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:35,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388571650] [2019-11-25 17:26:35,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:35,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 17:26:35,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553212024] [2019-11-25 17:26:35,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:26:35,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:26:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:26:35,844 INFO L87 Difference]: Start difference. First operand 320 states and 469 transitions. Second operand 3 states. [2019-11-25 17:26:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:35,863 INFO L93 Difference]: Finished difference Result 362 states and 510 transitions. [2019-11-25 17:26:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:26:35,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 17:26:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:35,871 INFO L225 Difference]: With dead ends: 362 [2019-11-25 17:26:35,871 INFO L226 Difference]: Without dead ends: 362 [2019-11-25 17:26:35,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:26:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-25 17:26:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 348. [2019-11-25 17:26:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-25 17:26:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 501 transitions. [2019-11-25 17:26:35,883 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 501 transitions. Word has length 24 [2019-11-25 17:26:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:35,884 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 501 transitions. [2019-11-25 17:26:35,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:26:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 501 transitions. [2019-11-25 17:26:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 17:26:35,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:35,885 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:36,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 17:26:36,098 INFO L410 AbstractCegarLoop]: === Iteration 11 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:36,098 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-25 17:26:36,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:36,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105869311] [2019-11-25 17:26:36,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:36,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 17:26:36,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:36,270 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:36,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105869311] [2019-11-25 17:26:36,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:36,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-25 17:26:36,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341093343] [2019-11-25 17:26:36,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:26:36,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:26:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:26:36,313 INFO L87 Difference]: Start difference. First operand 348 states and 501 transitions. Second operand 8 states. [2019-11-25 17:26:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:36,490 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2019-11-25 17:26:36,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:26:36,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-25 17:26:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:36,495 INFO L225 Difference]: With dead ends: 365 [2019-11-25 17:26:36,495 INFO L226 Difference]: Without dead ends: 365 [2019-11-25 17:26:36,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:26:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-25 17:26:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2019-11-25 17:26:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-25 17:26:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 421 transitions. [2019-11-25 17:26:36,514 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 421 transitions. Word has length 25 [2019-11-25 17:26:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:36,515 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 421 transitions. [2019-11-25 17:26:36,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:26:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 421 transitions. [2019-11-25 17:26:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 17:26:36,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:36,520 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:36,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 17:26:36,734 INFO L410 AbstractCegarLoop]: === Iteration 12 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2031405767, now seen corresponding path program 1 times [2019-11-25 17:26:36,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:36,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443918266] [2019-11-25 17:26:36,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:36,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 17:26:36,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:36,966 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:26:37,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443918266] [2019-11-25 17:26:37,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:26:37,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 17:26:37,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24211695] [2019-11-25 17:26:37,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:26:37,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:37,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:26:37,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:26:37,012 INFO L87 Difference]: Start difference. First operand 315 states and 421 transitions. Second operand 3 states. [2019-11-25 17:26:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:37,022 INFO L93 Difference]: Finished difference Result 229 states and 292 transitions. [2019-11-25 17:26:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:26:37,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-25 17:26:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:37,024 INFO L225 Difference]: With dead ends: 229 [2019-11-25 17:26:37,025 INFO L226 Difference]: Without dead ends: 229 [2019-11-25 17:26:37,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:26:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-25 17:26:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-11-25 17:26:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-25 17:26:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2019-11-25 17:26:37,035 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 33 [2019-11-25 17:26:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:37,035 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2019-11-25 17:26:37,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:26:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2019-11-25 17:26:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 17:26:37,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:26:37,042 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:26:37,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 17:26:37,255 INFO L410 AbstractCegarLoop]: === Iteration 13 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:26:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:26:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-25 17:26:37,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:26:37,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122508657] [2019-11-25 17:26:37,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-25 17:26:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:26:37,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 17:26:37,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:26:37,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:26:37,735 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 33 [2019-11-25 17:26:37,735 INFO L343 Elim1Store]: treesize reduction 339, result has 15.0 percent of original size [2019-11-25 17:26:37,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-25 17:26:37,736 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:37,833 INFO L588 ElimStorePlain]: treesize reduction 10, result has 87.7 percent of original size [2019-11-25 17:26:37,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:37,836 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:26:37,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:71 [2019-11-25 17:26:37,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:37,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:38,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:26:38,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:38,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:38,105 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:38,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:38,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:38,122 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:38,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:38,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:38,143 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:38,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:38,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:38,181 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:38,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:38,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:38,202 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:38,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:38,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2019-11-25 17:26:38,237 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-11-25 17:26:38,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:26:38,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2019-11-25 17:26:38,245 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:38,560 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-25 17:26:38,560 INFO L588 ElimStorePlain]: treesize reduction 88, result has 74.6 percent of original size [2019-11-25 17:26:38,562 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-11-25 17:26:38,563 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:394, output treesize:259 [2019-11-25 17:26:38,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:26:38,655 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:26:38,660 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:26:38,661 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:26:38,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 [2019-11-25 17:26:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 17:26:38,728 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:26:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-25 17:26:39,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122508657] [2019-11-25 17:26:39,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:26:39,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-25 17:26:39,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493490696] [2019-11-25 17:26:39,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:26:39,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:26:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:26:39,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:26:39,008 INFO L87 Difference]: Start difference. First operand 229 states and 292 transitions. Second operand 11 states. [2019-11-25 17:26:50,081 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-25 17:27:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:27:07,888 INFO L93 Difference]: Finished difference Result 325 states and 387 transitions. [2019-11-25 17:27:07,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:27:07,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-11-25 17:27:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:27:07,891 INFO L225 Difference]: With dead ends: 325 [2019-11-25 17:27:07,891 INFO L226 Difference]: Without dead ends: 319 [2019-11-25 17:27:07,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-25 17:27:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-25 17:27:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 282. [2019-11-25 17:27:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-25 17:27:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 358 transitions. [2019-11-25 17:27:07,904 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 358 transitions. Word has length 33 [2019-11-25 17:27:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:27:07,906 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 358 transitions. [2019-11-25 17:27:07,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:27:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2019-11-25 17:27:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 17:27:07,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:27:07,910 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:27:08,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 17:27:08,124 INFO L410 AbstractCegarLoop]: === Iteration 14 === [parse_inputErr7REQUIRES_VIOLATION, parse_inputErr1REQUIRES_VIOLATION, parse_inputErr6REQUIRES_VIOLATION, parse_inputErr0REQUIRES_VIOLATION, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr9REQUIRES_VIOLATION, parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr8REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, c1Err2ASSERT_VIOLATIONMEMORY_FREE, c1Err0ASSERT_VIOLATIONMEMORY_FREE, c1Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err3ASSERT_VIOLATIONMEMORY_FREE, c2Err1ASSERT_VIOLATIONMEMORY_FREE, c2Err4ASSERT_VIOLATIONMEMORY_FREE, c2Err5ASSERT_VIOLATIONMEMORY_FREE, c2Err0ASSERT_VIOLATIONMEMORY_FREE, c2Err2ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-25 17:27:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:27:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash -330240892, now seen corresponding path program 1 times [2019-11-25 17:27:08,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:27:08,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527878763] [2019-11-25 17:27:08,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-25 17:27:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:27:08,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-25 17:27:08,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:27:08,734 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-25 17:27:08,735 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-25 17:27:08,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 101 [2019-11-25 17:27:08,736 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:08,909 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-25 17:27:08,910 INFO L588 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-25 17:27:09,216 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-25 17:27:09,217 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-25 17:27:09,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 65 [2019-11-25 17:27:09,218 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:09,397 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-25 17:27:09,398 INFO L588 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-25 17:27:09,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:09,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:27:09,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,419 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-25 17:27:09,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-25 17:27:09,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:09,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:27:09,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:09,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:27:09,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,486 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:27:09,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:09,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:27:09,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,708 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:27:09,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:09,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:09,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:09,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:27:09,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:09,894 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:27:10,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:10,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:10,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:10,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:10,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:27:10,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:27:10,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:10,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:10,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:10,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:27:10,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:10,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:10,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:10,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:10,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:27:10,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:10,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:10,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:10,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:10,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:10,104 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:27:10,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:10,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-25 17:27:10,327 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:10,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:10,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 102 [2019-11-25 17:27:10,500 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:10,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:10,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 34 treesize of output 104 [2019-11-25 17:27:10,661 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:10,928 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:10,928 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:10,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 41 treesize of output 149 [2019-11-25 17:27:10,930 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 69 [2019-11-25 17:27:11,046 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 34 treesize of output 104 [2019-11-25 17:27:11,219 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-25 17:27:11,323 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-25 17:27:11,383 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 65 [2019-11-25 17:27:11,488 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:27:11,520 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 69 [2019-11-25 17:27:11,628 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-25 17:27:11,690 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:11,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:11,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 34 treesize of output 104 [2019-11-25 17:27:11,869 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 102 [2019-11-25 17:27:12,035 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,278 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:12,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 39 treesize of output 147 [2019-11-25 17:27:12,280 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,454 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 102 [2019-11-25 17:27:12,455 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,627 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-25 17:27:12,628 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 102 [2019-11-25 17:27:12,629 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:12,659 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:12,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 41 [2019-11-25 17:27:12,695 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:27:12,732 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:27:12,767 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,792 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:12,803 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:12,811 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-25 17:27:12,812 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:12,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-11-25 17:27:12,914 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:12,962 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:12,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 72 [2019-11-25 17:27:13,059 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2019-11-25 17:27:13,100 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-11-25 17:27:13,168 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 43 [2019-11-25 17:27:13,235 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,265 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,275 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2019-11-25 17:27:13,276 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,298 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,305 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 41 [2019-11-25 17:27:13,338 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,372 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,378 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-25 17:27:13,379 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,638 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:13,638 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 41 treesize of output 149 [2019-11-25 17:27:13,640 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,662 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,663 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 22 [2019-11-25 17:27:13,674 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-25 17:27:13,710 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:13,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 34 treesize of output 104 [2019-11-25 17:27:13,894 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:13,918 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:13,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 11 [2019-11-25 17:27:13,920 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,029 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-25 17:27:14,030 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-25 17:27:14,141 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 65 [2019-11-25 17:27:14,263 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:14,291 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:14,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2019-11-25 17:27:14,299 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-25 17:27:14,334 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:14,368 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:14,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 43 [2019-11-25 17:27:14,405 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:14,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:14,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2019-11-25 17:27:14,447 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 102 [2019-11-25 17:27:14,629 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 67 [2019-11-25 17:27:14,736 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:14,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:14,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 106 [2019-11-25 17:27:14,909 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 65 [2019-11-25 17:27:15,024 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,053 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2019-11-25 17:27:15,062 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,240 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 32 treesize of output 102 [2019-11-25 17:27:15,242 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 40 [2019-11-25 17:27:15,305 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,333 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,345 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-25 17:27:15,345 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,376 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 43 [2019-11-25 17:27:15,411 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:27:15,447 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,472 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2019-11-25 17:27:15,485 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,514 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2019-11-25 17:27:15,526 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,551 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,552 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 11 [2019-11-25 17:27:15,554 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,579 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 11 [2019-11-25 17:27:15,580 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,616 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2019-11-25 17:27:15,623 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-11-25 17:27:15,686 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 41 [2019-11-25 17:27:15,760 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,788 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2019-11-25 17:27:15,803 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,830 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2019-11-25 17:27:15,842 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,870 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,871 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,873 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2019-11-25 17:27:15,874 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:15,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,905 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,923 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:15,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:15,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 39 treesize of output 75 [2019-11-25 17:27:15,985 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,042 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 46 [2019-11-25 17:27:16,076 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-25 17:27:16,105 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,136 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,165 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 43 [2019-11-25 17:27:16,166 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,192 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,200 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,201 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,207 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2019-11-25 17:27:16,208 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,234 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 24 [2019-11-25 17:27:16,256 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-25 17:27:16,291 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,318 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,318 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,327 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,328 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2019-11-25 17:27:16,335 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,370 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2019-11-25 17:27:16,382 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,404 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,404 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,404 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-11-25 17:27:16,406 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:27:16,436 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,455 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,456 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 11 [2019-11-25 17:27:16,457 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2019-11-25 17:27:16,480 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2019-11-25 17:27:16,502 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,524 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,532 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 45 [2019-11-25 17:27:16,564 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,587 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,587 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,587 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,588 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,588 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,589 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2019-11-25 17:27:16,591 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,614 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-25 17:27:16,626 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2019-11-25 17:27:16,666 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:27:16,698 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,718 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2019-11-25 17:27:16,721 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,741 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 11 [2019-11-25 17:27:16,743 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 14 [2019-11-25 17:27:16,764 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,785 INFO L377 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 7 treesize of output 5 [2019-11-25 17:27:16,785 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,803 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,804 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,822 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:16,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:16,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2019-11-25 17:27:16,837 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,854 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,854 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,889 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,889 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,906 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,906 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,922 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,922 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,939 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,940 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,956 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,957 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,974 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,974 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:16,991 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:16,992 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,011 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,011 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,032 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,034 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 27 [2019-11-25 17:27:17,048 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,067 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,067 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,083 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,084 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,105 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,106 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 14 [2019-11-25 17:27:17,109 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,128 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,128 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,144 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,145 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,162 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,162 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,180 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,180 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,197 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,197 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,216 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,216 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,232 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,232 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,250 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,250 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,268 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,268 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,286 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,286 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,304 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,304 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,330 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,330 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,351 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,352 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,371 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,371 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,387 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,387 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,403 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,403 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,419 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,419 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,440 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,440 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,442 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2019-11-25 17:27:17,443 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,461 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,462 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,481 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,485 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 27 [2019-11-25 17:27:17,494 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,512 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,513 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,530 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,530 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,548 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,549 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,566 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,567 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,584 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,584 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,600 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,601 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:17,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-25 17:27:17,632 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,652 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,652 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,669 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,669 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,691 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,694 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-11-25 17:27:17,695 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,710 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,711 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,732 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,732 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,734 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2019-11-25 17:27:17,735 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,751 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,751 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,769 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,769 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,785 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,785 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,803 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,803 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,821 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,821 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,838 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,838 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,855 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,856 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,871 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,872 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,889 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,889 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,905 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,905 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,921 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,921 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,938 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,938 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,962 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:17,963 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:17,983 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,986 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:17,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2019-11-25 17:27:17,987 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,005 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:18,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:18,007 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:18,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:18,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:18,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:27:18,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-11-25 17:27:18,010 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,024 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,024 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,040 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,040 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,056 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,056 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,072 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,072 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,088 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,088 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,104 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,104 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,123 INFO L377 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 7 treesize of output 5 [2019-11-25 17:27:18,123 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,140 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,140 INFO L508 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,157 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,157 INFO L508 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,174 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,174 INFO L508 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,190 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,190 INFO L508 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,204 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,204 INFO L508 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,219 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,219 INFO L508 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,233 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,234 INFO L508 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,249 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,249 INFO L508 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,266 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,266 INFO L508 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,282 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,282 INFO L508 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,298 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,298 INFO L508 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,313 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,313 INFO L508 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,328 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,328 INFO L508 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,343 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,343 INFO L508 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,368 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,368 INFO L508 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,382 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,383 INFO L508 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,397 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,397 INFO L508 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,412 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,413 INFO L508 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,427 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,427 INFO L508 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,441 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,441 INFO L508 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,455 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,455 INFO L508 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,469 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,470 INFO L508 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,484 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,484 INFO L508 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,498 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,499 INFO L508 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,512 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,512 INFO L508 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,525 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-25 17:27:18,526 INFO L508 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,752 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-11-25 17:27:18,753 INFO L588 ElimStorePlain]: treesize reduction 1999, result has 0.8 percent of original size [2019-11-25 17:27:18,756 INFO L377 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 7 treesize of output 5 [2019-11-25 17:27:18,756 INFO L508 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,762 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:18,763 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:27:18,763 INFO L221 ElimStorePlain]: Needed 181 recursive calls to eliminate 7 variables, input treesize:10867, output treesize:10 [2019-11-25 17:27:18,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:18,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:18,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-25 17:27:18,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 17:27:18,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:18,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-25 17:27:18,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:18,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:18,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:18,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-25 17:27:18,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:18,829 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 17:27:18,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:19,110 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:19,111 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:19,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:19,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:19,350 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:19,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:19,504 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:19,505 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:19,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,697 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:19,698 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 94 [2019-11-25 17:27:19,699 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:19,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:19,810 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:19,811 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:19,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:19,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:19,879 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:19,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:19,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,063 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:20,063 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:20,064 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:20,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:20,174 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:20,174 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:20,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:20,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:20,257 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:20,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:20,418 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:20,419 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:20,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:20,525 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:20,526 INFO L508 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:20,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:20,636 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:20,637 INFO L508 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:20,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,742 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:20,743 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:20,743 INFO L508 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:20,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:20,851 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:20,852 INFO L508 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:20,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:20,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:21,019 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:21,020 INFO L508 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:21,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,072 INFO L377 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 14 treesize of output 16 [2019-11-25 17:27:21,073 INFO L508 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:21,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:21,211 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:21,211 INFO L508 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:21,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,363 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-11-25 17:27:21,491 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-25 17:27:21,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:21,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:21,493 INFO L508 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:21,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:21,671 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:21,672 INFO L508 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:21,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:21,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:21,922 INFO L508 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:21,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:21,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:22,034 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:22,035 INFO L508 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:22,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:22,148 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:22,148 INFO L508 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:22,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:22,313 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:22,314 INFO L508 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:22,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,425 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:22,425 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:22,426 INFO L508 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:22,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,613 INFO L237 Elim1Store]: Index analysis took 152 ms [2019-11-25 17:27:22,782 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:22,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:22,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 182 [2019-11-25 17:27:22,785 INFO L508 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:22,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:22,897 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:22,898 INFO L508 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:22,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:22,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,074 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:23,075 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:23,076 INFO L508 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:23,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:23,251 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:23,252 INFO L508 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:23,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:23,369 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:23,369 INFO L508 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:23,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:23,483 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:23,484 INFO L508 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:23,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:23,620 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:23,621 INFO L508 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:23,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:23,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:23,693 INFO L508 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:23,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:23,881 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:23,882 INFO L508 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:23,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:23,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:23,996 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:23,996 INFO L508 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:24,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:24,179 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:24,180 INFO L508 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:24,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:24,303 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:24,304 INFO L508 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:24,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:24,431 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:24,432 INFO L508 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:24,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:24,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:24,509 INFO L508 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:24,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:24,695 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 94 [2019-11-25 17:27:24,696 INFO L508 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:24,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:24,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:24,777 INFO L508 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:24,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:24,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:24,968 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:24,969 INFO L508 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:25,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:25,098 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:25,099 INFO L508 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:25,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,283 INFO L237 Elim1Store]: Index analysis took 147 ms [2019-11-25 17:27:25,480 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:25,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:25,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 182 [2019-11-25 17:27:25,484 INFO L508 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:25,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,602 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:25,603 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:25,604 INFO L508 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:25,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:25,831 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:25,832 INFO L508 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:25,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:25,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:25,968 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:25,969 INFO L508 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:26,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:26,153 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 94 [2019-11-25 17:27:26,154 INFO L508 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:26,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,287 INFO L237 Elim1Store]: Index analysis took 102 ms [2019-11-25 17:27:26,412 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-25 17:27:26,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:26,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:26,415 INFO L508 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:26,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:26,590 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:26,591 INFO L508 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:26,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,735 INFO L237 Elim1Store]: Index analysis took 111 ms [2019-11-25 17:27:26,847 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:26,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:26,849 INFO L508 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:26,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:26,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:27,041 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:27,042 INFO L508 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:27,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:27,211 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:27,212 INFO L508 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:27,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:27,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:27,284 INFO L508 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:27,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,438 INFO L237 Elim1Store]: Index analysis took 119 ms [2019-11-25 17:27:27,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:27,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:27,555 INFO L508 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:27,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,689 INFO L237 Elim1Store]: Index analysis took 102 ms [2019-11-25 17:27:27,814 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:27,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:27,816 INFO L508 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:27,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,931 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:27,931 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:27,932 INFO L508 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:27,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:27,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:28,069 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:28,070 INFO L508 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:28,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,221 INFO L237 Elim1Store]: Index analysis took 117 ms [2019-11-25 17:27:28,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:28,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:28,338 INFO L508 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:28,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:28,525 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:28,526 INFO L508 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:28,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:28,707 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 94 [2019-11-25 17:27:28,708 INFO L508 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:28,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:28,823 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:28,824 INFO L508 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:28,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:28,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:29,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:29,080 INFO L508 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:29,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:29,220 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:29,221 INFO L508 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:29,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,362 INFO L237 Elim1Store]: Index analysis took 107 ms [2019-11-25 17:27:29,493 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-25 17:27:29,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:29,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:29,495 INFO L508 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:29,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:29,619 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:29,620 INFO L508 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:29,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,764 INFO L237 Elim1Store]: Index analysis took 109 ms [2019-11-25 17:27:29,879 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:29,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:29,881 INFO L508 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:29,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:29,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,023 INFO L237 Elim1Store]: Index analysis took 106 ms [2019-11-25 17:27:30,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:30,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:30,132 INFO L508 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:30,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,250 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:30,251 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:30,251 INFO L508 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:30,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:30,437 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:30,438 INFO L508 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:30,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,490 INFO L377 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 14 treesize of output 16 [2019-11-25 17:27:30,490 INFO L508 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:30,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:30,674 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:30,675 INFO L508 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:30,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:30,799 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:30,800 INFO L508 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:30,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:30,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:30,882 INFO L508 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:30,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:30,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:30,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:30,971 INFO L508 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:31,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,166 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:31,167 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:31,168 INFO L508 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:31,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,335 INFO L237 Elim1Store]: Index analysis took 128 ms [2019-11-25 17:27:31,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:31,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:31,462 INFO L508 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:31,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:31,580 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-25 17:27:31,581 INFO L508 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:31,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:31,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:31,671 INFO L508 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:31,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:31,855 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:31,856 INFO L508 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:31,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:31,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:32,068 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:32,069 INFO L508 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:32,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,301 INFO L237 Elim1Store]: Index analysis took 168 ms [2019-11-25 17:27:32,482 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:32,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:32,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 182 [2019-11-25 17:27:32,486 INFO L508 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:32,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:32,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:32,560 INFO L508 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:32,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:32,748 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:32,750 INFO L508 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:32,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,876 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:32,877 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:32,878 INFO L508 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:32,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:32,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:33,035 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:33,036 INFO L508 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:33,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:33,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:33,127 INFO L508 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:33,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,271 INFO L237 Elim1Store]: Index analysis took 104 ms [2019-11-25 17:27:33,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:33,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:33,393 INFO L508 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:33,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,545 INFO L237 Elim1Store]: Index analysis took 114 ms [2019-11-25 17:27:33,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:33,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:33,667 INFO L508 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:33,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:33,782 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:33,782 INFO L508 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:33,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:33,896 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:33,897 INFO L508 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:33,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:33,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,021 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:34,021 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:34,022 INFO L508 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:34,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:34,139 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:34,140 INFO L508 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:34,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,272 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:34,272 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-25 17:27:34,273 INFO L508 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:34,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,432 INFO L237 Elim1Store]: Index analysis took 120 ms [2019-11-25 17:27:34,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:34,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:34,560 INFO L508 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:34,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:34,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:34,640 INFO L508 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:34,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,783 INFO L237 Elim1Store]: Index analysis took 107 ms [2019-11-25 17:27:34,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:34,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:34,903 INFO L508 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:34,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:34,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,062 INFO L237 Elim1Store]: Index analysis took 123 ms [2019-11-25 17:27:35,176 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:35,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:35,178 INFO L508 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:35,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,293 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:35,294 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-25 17:27:35,295 INFO L508 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:35,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,480 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:35,480 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:35,481 INFO L508 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:35,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:35,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:35,561 INFO L508 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:35,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,675 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:35,676 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:35,677 INFO L508 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:35,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:35,846 INFO L237 Elim1Store]: Index analysis took 128 ms [2019-11-25 17:27:35,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:35,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:35,965 INFO L508 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:36,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:36,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:36,042 INFO L508 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:36,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:36,219 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:36,220 INFO L508 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:36,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,341 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:36,342 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:36,343 INFO L508 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:36,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,535 INFO L237 Elim1Store]: Index analysis took 154 ms [2019-11-25 17:27:36,717 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:36,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:36,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 182 [2019-11-25 17:27:36,720 INFO L508 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:36,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:36,911 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:36,912 INFO L508 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:36,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:36,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:37,037 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:37,038 INFO L508 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:37,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,225 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:37,225 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:37,226 INFO L508 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:37,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:37,410 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:37,412 INFO L508 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:37,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:37,608 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 94 [2019-11-25 17:27:37,609 INFO L508 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:37,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:37,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:37,692 INFO L508 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:37,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:37,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:37,773 INFO L508 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:37,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:37,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:37,970 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:37,971 INFO L508 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:38,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:38,157 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 94 [2019-11-25 17:27:38,158 INFO L508 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:38,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:38,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:38,242 INFO L508 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:38,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:38,432 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:38,433 INFO L508 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:38,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:38,563 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:38,564 INFO L508 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:38,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:38,692 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:38,693 INFO L508 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:38,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:38,830 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:38,831 INFO L508 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:38,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:38,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:38,914 INFO L508 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:38,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:38,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:39,106 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:39,106 INFO L508 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:39,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:39,236 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:39,237 INFO L508 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:39,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:39,422 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:39,423 INFO L508 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:39,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,569 INFO L237 Elim1Store]: Index analysis took 103 ms [2019-11-25 17:27:39,690 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:39,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:39,692 INFO L508 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:39,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:39,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:39,788 INFO L508 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:39,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:39,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:39,980 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:39,982 INFO L508 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:40,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:40,116 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:40,117 INFO L508 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:40,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:40,333 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:40,334 INFO L508 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:40,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:40,522 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:40,523 INFO L508 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:40,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,715 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:40,715 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:40,716 INFO L508 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:40,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:40,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:40,796 INFO L508 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:40,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,852 INFO L377 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 14 treesize of output 16 [2019-11-25 17:27:40,853 INFO L508 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:40,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:40,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:40,928 INFO L508 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:40,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:40,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,084 INFO L237 Elim1Store]: Index analysis took 116 ms [2019-11-25 17:27:41,215 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-25 17:27:41,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:41,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:41,218 INFO L508 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:41,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:41,403 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:41,404 INFO L508 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:41,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:41,541 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:41,542 INFO L508 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:41,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:41,670 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:41,670 INFO L508 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:41,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:41,866 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:41,867 INFO L508 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:41,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:41,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,048 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:42,048 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:42,049 INFO L508 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:42,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:42,231 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:42,232 INFO L508 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:42,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,365 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:42,366 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:42,367 INFO L508 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:42,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,556 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:42,557 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:42,558 INFO L508 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:42,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,725 INFO L237 Elim1Store]: Index analysis took 121 ms [2019-11-25 17:27:42,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:42,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:42,843 INFO L508 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:42,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:42,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:42,964 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-25 17:27:42,965 INFO L508 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:43,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,164 INFO L237 Elim1Store]: Index analysis took 158 ms [2019-11-25 17:27:43,360 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:43,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:43,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 182 [2019-11-25 17:27:43,363 INFO L508 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:43,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:43,558 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:43,559 INFO L508 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:43,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:43,685 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:43,686 INFO L508 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:43,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:43,845 INFO L237 Elim1Store]: Index analysis took 120 ms [2019-11-25 17:27:43,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:43,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:43,960 INFO L508 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:44,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:44,088 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:44,089 INFO L508 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:44,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:44,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:44,171 INFO L508 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:44,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:44,302 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:44,302 INFO L508 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:44,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,461 INFO L237 Elim1Store]: Index analysis took 116 ms [2019-11-25 17:27:44,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:44,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:44,578 INFO L508 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:44,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:44,714 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 60 [2019-11-25 17:27:44,715 INFO L508 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:44,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,844 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:44,845 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:44,846 INFO L508 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:44,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:44,994 INFO L237 Elim1Store]: Index analysis took 104 ms [2019-11-25 17:27:45,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:45,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:45,110 INFO L508 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:45,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,274 INFO L237 Elim1Store]: Index analysis took 119 ms [2019-11-25 17:27:45,411 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-25 17:27:45,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:45,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:45,412 INFO L508 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:45,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,599 INFO L237 Elim1Store]: Index analysis took 141 ms [2019-11-25 17:27:45,783 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:45,784 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:45,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 182 [2019-11-25 17:27:45,786 INFO L508 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:45,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:45,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:45,976 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:45,976 INFO L508 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:46,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,030 INFO L377 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 14 treesize of output 16 [2019-11-25 17:27:46,030 INFO L508 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:46,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:46,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:46,113 INFO L508 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:46,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,270 INFO L237 Elim1Store]: Index analysis took 112 ms [2019-11-25 17:27:46,420 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-25 17:27:46,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:46,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:46,422 INFO L508 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:46,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:46,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:46,511 INFO L508 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:46,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,705 INFO L237 Elim1Store]: Index analysis took 150 ms [2019-11-25 17:27:46,905 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-25 17:27:46,905 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:46,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 182 [2019-11-25 17:27:46,907 INFO L508 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:46,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:46,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:47,101 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:47,103 INFO L508 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:47,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,265 INFO L237 Elim1Store]: Index analysis took 117 ms [2019-11-25 17:27:47,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:47,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:47,392 INFO L508 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:47,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,577 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-11-25 17:27:47,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:47,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:47,702 INFO L508 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:47,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:47,863 INFO L237 Elim1Store]: Index analysis took 122 ms [2019-11-25 17:27:47,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:47,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:47,984 INFO L508 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:48,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,106 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:48,107 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:48,108 INFO L508 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:48,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:48,225 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-25 17:27:48,225 INFO L508 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:48,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:48,354 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:48,355 INFO L508 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:48,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,518 INFO L237 Elim1Store]: Index analysis took 123 ms [2019-11-25 17:27:48,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:48,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 132 [2019-11-25 17:27:48,638 INFO L508 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:48,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,827 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:48,827 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:48,829 INFO L508 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:48,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:48,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,024 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:49,025 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:49,026 INFO L508 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:49,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,229 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:49,230 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:49,230 INFO L508 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:49,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:49,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:49,311 INFO L508 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:49,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:49,427 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2019-11-25 17:27:49,428 INFO L508 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:49,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:49,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 34 [2019-11-25 17:27:49,503 INFO L508 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:49,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:49,713 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:49,714 INFO L508 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:49,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,790 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:49,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:49,791 INFO L508 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:49,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,853 INFO L377 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 14 treesize of output 16 [2019-11-25 17:27:49,853 INFO L508 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:49,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:49,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,039 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:50,039 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:50,040 INFO L508 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:50,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:50,216 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:50,217 INFO L508 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:50,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:50,434 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:50,435 INFO L508 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:50,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:50,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2019-11-25 17:27:50,523 INFO L508 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:50,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:50,656 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-25 17:27:50,657 INFO L508 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:50,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:50,846 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 92 [2019-11-25 17:27:50,847 INFO L508 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:50,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:50,994 INFO L237 Elim1Store]: Index analysis took 103 ms [2019-11-25 17:27:51,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:51,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 134 [2019-11-25 17:27:51,113 INFO L508 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:51,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:51,246 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 56 [2019-11-25 17:27:51,247 INFO L508 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:51,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:51,437 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:51,438 INFO L508 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:51,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:51,575 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:51,576 INFO L377 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 90 [2019-11-25 17:27:51,577 INFO L508 ElimStorePlain]: Start of recursive call 192: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:54,263 WARN L192 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 395 DAG size of output: 32 [2019-11-25 17:27:54,264 INFO L588 ElimStorePlain]: treesize reduction 21347, result has 0.5 percent of original size [2019-11-25 17:27:54,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:54,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:27:54,271 INFO L508 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:54,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:54,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 17:27:54,277 INFO L508 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:54,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:54,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:27:54,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:27:54,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2019-11-25 17:27:54,291 INFO L508 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2019-11-25 17:27:54,316 INFO L588 ElimStorePlain]: treesize reduction 43, result has 27.1 percent of original size [2019-11-25 17:27:54,316 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:27:54,317 INFO L221 ElimStorePlain]: Needed 195 recursive calls to eliminate 8 variables, input treesize:13986, output treesize:16 [2019-11-25 17:27:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:27:54,386 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:27:54,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:54,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:55,240 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-25 17:27:55,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:27:55,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:55,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:27:55,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:27:55,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:27:55,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:27:55,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:27:55,258 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 22 [2019-11-25 17:27:55,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-25 17:27:55,286 INFO L404 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_3|], 6=[|v_old(#valid)_BEFORE_CALL_3|]} [2019-11-25 17:27:55,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 17:27:55,499 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:351) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 17:27:55,505 INFO L168 Benchmark]: Toolchain (without parser) took 122056.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.0 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -55.8 MB). Peak memory consumption was 409.3 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:55,506 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:27:55,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:55,506 INFO L168 Benchmark]: Boogie Preprocessor took 82.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:27:55,506 INFO L168 Benchmark]: RCFGBuilder took 844.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:55,507 INFO L168 Benchmark]: TraceAbstraction took 120420.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.6 MB). Peak memory consumption was 352.2 MB. Max. memory is 11.5 GB. [2019-11-25 17:27:55,508 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 703.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 844.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 120420.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.6 MB). Peak memory consumption was 352.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...