./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 5a079682 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-5a07968 [2019-11-22 11:01:33,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:01:33,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:01:33,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:01:33,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:01:33,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:01:33,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:01:33,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:01:33,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:01:33,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:01:33,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:01:33,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:01:33,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:01:33,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:01:33,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:01:33,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:01:33,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:01:33,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:01:33,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:01:33,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:01:33,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:01:33,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:01:33,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:01:33,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:01:33,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:01:33,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:01:33,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:01:33,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:01:33,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:01:33,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:01:33,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:01:33,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:01:33,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:01:33,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:01:33,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:01:33,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:01:33,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:01:33,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:01:33,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:01:33,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:01:33,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:01:33,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 11:01:33,405 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:01:33,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:01:33,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:01:33,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:01:33,407 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:01:33,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:01:33,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:01:33,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:01:33,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:01:33,408 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:01:33,410 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:01:33,410 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 11:01:33,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:01:33,411 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:01:33,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:01:33,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:01:33,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:01:33,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:01:33,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:01:33,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:01:33,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:01:33,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:01:33,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:01:33,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:01:33,413 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-22 11:01:33,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:01:33,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:01:33,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:01:33,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:01:33,733 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:01:33,734 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-22 11:01:33,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6769c8221/d589c67739144462ad583efe133412c4/FLAG28da8be97 [2019-11-22 11:01:34,324 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:01:34,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 11:01:34,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6769c8221/d589c67739144462ad583efe133412c4/FLAG28da8be97 [2019-11-22 11:01:34,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6769c8221/d589c67739144462ad583efe133412c4 [2019-11-22 11:01:34,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:01:34,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:01:34,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:01:34,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:01:34,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:01:34,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:01:34" (1/1) ... [2019-11-22 11:01:34,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c177520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:34, skipping insertion in model container [2019-11-22 11:01:34,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:01:34" (1/1) ... [2019-11-22 11:01:34,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:01:34,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:01:35,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:01:35,179 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:01:35,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:01:35,330 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:01:35,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35 WrapperNode [2019-11-22 11:01:35,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:01:35,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:01:35,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:01:35,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:01:35,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (1/1) ... [2019-11-22 11:01:35,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:01:35,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:01:35,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:01:35,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:01:35,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (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-22 11:01:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:01:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:01:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 11:01:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 11:01:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 11:01:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 11:01:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 11:01:35,473 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 11:01:35,473 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:01:35,473 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 11:01:35,473 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 11:01:35,473 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 11:01:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 11:01:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 11:01:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 11:01:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 11:01:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 11:01:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 11:01:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 11:01:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 11:01:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 11:01:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 11:01:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 11:01:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 11:01:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 11:01:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 11:01:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 11:01:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 11:01:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 11:01:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 11:01:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 11:01:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 11:01:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 11:01:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 11:01:35,481 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 11:01:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 11:01:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 11:01:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 11:01:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 11:01:35,482 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 11:01:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 11:01:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 11:01:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 11:01:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 11:01:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 11:01:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 11:01:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 11:01:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 11:01:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 11:01:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 11:01:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 11:01:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 11:01:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 11:01:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 11:01:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 11:01:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 11:01:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 11:01:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 11:01:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 11:01:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 11:01:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 11:01:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 11:01:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:01:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 11:01:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:01:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 11:01:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 11:01:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 11:01:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 11:01:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 11:01:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 11:01:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 11:01:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 11:01:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 11:01:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 11:01:35,491 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 11:01:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 11:01:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 11:01:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 11:01:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 11:01:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 11:01:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 11:01:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 11:01:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 11:01:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 11:01:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 11:01:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 11:01:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 11:01:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 11:01:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 11:01:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 11:01:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 11:01:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 11:01:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 11:01:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 11:01:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 11:01:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 11:01:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 11:01:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 11:01:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 11:01:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 11:01:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 11:01:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 11:01:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 11:01:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 11:01:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 11:01:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 11:01:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 11:01:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 11:01:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 11:01:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 11:01:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 11:01:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 11:01:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 11:01:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 11:01:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 11:01:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 11:01:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 11:01:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 11:01:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 11:01:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 11:01:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 11:01:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 11:01:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 11:01:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 11:01:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 11:01:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 11:01:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 11:01:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 11:01:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 11:01:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 11:01:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 11:01:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 11:01:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 11:01:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 11:01:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 11:01:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 11:01:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 11:01:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 11:01:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 11:01:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 11:01:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 11:01:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 11:01:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 11:01:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 11:01:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 11:01:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 11:01:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 11:01:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 11:01:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 11:01:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 11:01:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 11:01:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 11:01:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 11:01:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 11:01:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 11:01:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 11:01:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 11:01:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 11:01:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 11:01:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 11:01:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 11:01:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 11:01:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 11:01:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 11:01:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 11:01:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 11:01:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:01:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:01:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:01:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-22 11:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 11:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 11:01:35,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:01:36,178 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:01:36,178 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 11:01:36,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:36 BoogieIcfgContainer [2019-11-22 11:01:36,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:01:36,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:01:36,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:01:36,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:01:36,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:01:34" (1/3) ... [2019-11-22 11:01:36,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4c0466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:01:36, skipping insertion in model container [2019-11-22 11:01:36,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:01:35" (2/3) ... [2019-11-22 11:01:36,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4c0466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:01:36, skipping insertion in model container [2019-11-22 11:01:36,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:36" (3/3) ... [2019-11-22 11:01:36,188 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-22 11:01:36,200 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:01:36,208 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 11:01:36,220 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 11:01:36,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:01:36,241 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:01:36,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:01:36,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:01:36,242 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:01:36,242 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:01:36,242 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:01:36,242 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:01:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 11:01:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:01:36,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:36,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:36,276 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-22 11:01:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:36,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989328, now seen corresponding path program 1 times [2019-11-22 11:01:36,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:36,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762027478] [2019-11-22 11:01:36,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:36,766 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-22 11:01:36,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762027478] [2019-11-22 11:01:36,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:36,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 11:01:36,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905311970] [2019-11-22 11:01:36,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:01:36,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:36,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:01:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:01:36,794 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2019-11-22 11:01:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:37,370 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-11-22 11:01:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:01:37,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-22 11:01:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:37,385 INFO L225 Difference]: With dead ends: 105 [2019-11-22 11:01:37,385 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 11:01:37,387 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-22 11:01:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 11:01:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-11-22 11:01:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-22 11:01:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2019-11-22 11:01:37,481 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 9 [2019-11-22 11:01:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:37,482 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2019-11-22 11:01:37,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:01:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2019-11-22 11:01:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:01:37,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:37,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:37,485 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-22 11:01:37,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:37,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1583989329, now seen corresponding path program 1 times [2019-11-22 11:01:37,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:37,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478216857] [2019-11-22 11:01:37,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:37,768 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-22 11:01:37,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478216857] [2019-11-22 11:01:37,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:37,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:01:37,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981695162] [2019-11-22 11:01:37,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:01:37,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:01:37,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:01:37,776 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand 6 states. [2019-11-22 11:01:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:38,693 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2019-11-22 11:01:38,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:01:38,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 11:01:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:38,697 INFO L225 Difference]: With dead ends: 176 [2019-11-22 11:01:38,697 INFO L226 Difference]: Without dead ends: 176 [2019-11-22 11:01:38,698 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-22 11:01:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-22 11:01:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2019-11-22 11:01:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-22 11:01:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2019-11-22 11:01:38,733 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 9 [2019-11-22 11:01:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:38,733 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2019-11-22 11:01:38,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:01:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2019-11-22 11:01:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:01:38,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:38,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:38,737 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-22 11:01:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:38,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1859028932, now seen corresponding path program 1 times [2019-11-22 11:01:38,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:38,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256530219] [2019-11-22 11:01:38,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:39,125 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-22 11:01:39,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256530219] [2019-11-22 11:01:39,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:39,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:01:39,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012465102] [2019-11-22 11:01:39,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:01:39,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:39,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:01:39,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:01:39,128 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand 6 states. [2019-11-22 11:01:39,380 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-22 11:01:39,529 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-11-22 11:01:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:40,454 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-11-22 11:01:40,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:01:40,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-22 11:01:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:40,459 INFO L225 Difference]: With dead ends: 270 [2019-11-22 11:01:40,459 INFO L226 Difference]: Without dead ends: 270 [2019-11-22 11:01:40,460 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-22 11:01:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-22 11:01:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 219. [2019-11-22 11:01:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-22 11:01:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2019-11-22 11:01:40,493 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 10 [2019-11-22 11:01:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:40,494 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2019-11-22 11:01:40,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:01:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2019-11-22 11:01:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 11:01:40,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:40,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:40,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-22 11:01:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:40,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1795322128, now seen corresponding path program 1 times [2019-11-22 11:01:40,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:40,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625278075] [2019-11-22 11:01:40,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:40,812 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-22 11:01:40,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625278075] [2019-11-22 11:01:40,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:40,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:01:40,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991055862] [2019-11-22 11:01:40,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:01:40,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:40,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:01:40,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:01:40,815 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand 6 states. [2019-11-22 11:01:41,075 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-11-22 11:01:41,280 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-11-22 11:01:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:42,037 INFO L93 Difference]: Finished difference Result 256 states and 361 transitions. [2019-11-22 11:01:42,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:01:42,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-22 11:01:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:42,042 INFO L225 Difference]: With dead ends: 256 [2019-11-22 11:01:42,042 INFO L226 Difference]: Without dead ends: 256 [2019-11-22 11:01:42,043 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-22 11:01:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-22 11:01:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2019-11-22 11:01:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-22 11:01:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 322 transitions. [2019-11-22 11:01:42,067 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 322 transitions. Word has length 11 [2019-11-22 11:01:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:42,068 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 322 transitions. [2019-11-22 11:01:42,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:01:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 322 transitions. [2019-11-22 11:01:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 11:01:42,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:42,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:42,069 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-22 11:01:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash -179588794, now seen corresponding path program 1 times [2019-11-22 11:01:42,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:42,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434775056] [2019-11-22 11:01:42,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:42,209 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-22 11:01:42,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434775056] [2019-11-22 11:01:42,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:42,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:01:42,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230311769] [2019-11-22 11:01:42,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:01:42,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:01:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:01:42,213 INFO L87 Difference]: Start difference. First operand 219 states and 322 transitions. Second operand 7 states. [2019-11-22 11:01:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:43,270 INFO L93 Difference]: Finished difference Result 290 states and 395 transitions. [2019-11-22 11:01:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:01:43,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-22 11:01:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:43,275 INFO L225 Difference]: With dead ends: 290 [2019-11-22 11:01:43,275 INFO L226 Difference]: Without dead ends: 290 [2019-11-22 11:01:43,276 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-22 11:01:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-22 11:01:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 254. [2019-11-22 11:01:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-22 11:01:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-22 11:01:43,316 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 12 [2019-11-22 11:01:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:43,318 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-22 11:01:43,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:01:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-22 11:01:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 11:01:43,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:43,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:43,319 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-22 11:01:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1272285230, now seen corresponding path program 1 times [2019-11-22 11:01:43,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:43,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990397763] [2019-11-22 11:01:43,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:43,584 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-22 11:01:43,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990397763] [2019-11-22 11:01:43,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:01:43,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:01:43,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597398017] [2019-11-22 11:01:43,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:01:43,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:43,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:01:43,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:01:43,591 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 7 states. [2019-11-22 11:01:43,922 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-22 11:01:44,108 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-22 11:01:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:44,770 INFO L93 Difference]: Finished difference Result 280 states and 383 transitions. [2019-11-22 11:01:44,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:01:44,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-22 11:01:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:44,774 INFO L225 Difference]: With dead ends: 280 [2019-11-22 11:01:44,774 INFO L226 Difference]: Without dead ends: 280 [2019-11-22 11:01:44,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:01:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-22 11:01:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 254. [2019-11-22 11:01:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-22 11:01:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-22 11:01:44,789 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 13 [2019-11-22 11:01:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:44,789 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-22 11:01:44,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:01:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-22 11:01:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 11:01:44,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:44,790 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:44,791 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-22 11:01:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash 668439832, now seen corresponding path program 1 times [2019-11-22 11:01:44,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:44,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914663131] [2019-11-22 11:01:44,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:44,938 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-22 11:01:44,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914663131] [2019-11-22 11:01:44,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540416975] [2019-11-22 11:01:44,939 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-22 11:01:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:45,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:01:45,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:45,422 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:01:45,423 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:01:45,424 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-22 11:01:45,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:45,497 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 11:01:45,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:01:45,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 11:01:45,551 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-22 11:01:45,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:45,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-11-22 11:01:45,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634184326] [2019-11-22 11:01:45,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:01:45,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:45,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:01:45,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:01:45,553 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 10 states. [2019-11-22 11:01:45,976 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-22 11:01:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:46,516 INFO L93 Difference]: Finished difference Result 301 states and 422 transitions. [2019-11-22 11:01:46,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:01:46,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-22 11:01:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:46,519 INFO L225 Difference]: With dead ends: 301 [2019-11-22 11:01:46,519 INFO L226 Difference]: Without dead ends: 301 [2019-11-22 11:01:46,519 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-22 11:01:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-22 11:01:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 257. [2019-11-22 11:01:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-22 11:01:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 367 transitions. [2019-11-22 11:01:46,536 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 367 transitions. Word has length 17 [2019-11-22 11:01:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:46,537 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 367 transitions. [2019-11-22 11:01:46,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:01:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 367 transitions. [2019-11-22 11:01:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 11:01:46,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:46,538 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:46,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:46,742 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-22 11:01:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash -753201699, now seen corresponding path program 1 times [2019-11-22 11:01:46,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:46,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398252157] [2019-11-22 11:01:46,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:47,091 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-22 11:01:47,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398252157] [2019-11-22 11:01:47,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302239438] [2019-11-22 11:01:47,092 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-22 11:01:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:47,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-22 11:01:47,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:47,548 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 65 [2019-11-22 11:01:47,549 INFO L343 Elim1Store]: treesize reduction 487, result has 22.1 percent of original size [2019-11-22 11:01:47,550 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-22 11:01:47,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:47,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:48,246 WARN L192 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 61 [2019-11-22 11:01:48,248 INFO L567 ElimStorePlain]: treesize reduction 12278, result has 1.1 percent of original size [2019-11-22 11:01:48,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:48,257 INFO L496 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-22 11:01:48,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:120, output treesize:134 [2019-11-22 11:01:48,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:48,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:48,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:48,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:49,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:01:49,487 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-11-22 11:01:50,367 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-22 11:01:50,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:01:50,411 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 98 treesize of output 74 [2019-11-22 11:01:50,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:50,537 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-22 11:01:50,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:50,553 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 105 treesize of output 77 [2019-11-22 11:01:50,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:50,676 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-22 11:01:50,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:50,686 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 103 treesize of output 79 [2019-11-22 11:01:50,687 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:50,841 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-22 11:01:50,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:50,844 INFO L496 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-22 11:01:50,844 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 17 variables, input treesize:307, output treesize:222 [2019-11-22 11:01:51,019 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-22 11:01:51,039 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-22 11:01:51,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:51,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 14 [2019-11-22 11:01:51,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77991169] [2019-11-22 11:01:51,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-22 11:01:51,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-22 11:01:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-22 11:01:51,041 INFO L87 Difference]: Start difference. First operand 257 states and 367 transitions. Second operand 15 states. [2019-11-22 11:01:51,563 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-22 11:01:54,293 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 195 DAG size of output: 178 [2019-11-22 11:01:54,598 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-11-22 11:01:55,466 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 178 [2019-11-22 11:01:55,925 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-11-22 11:01:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:01:58,061 INFO L93 Difference]: Finished difference Result 320 states and 444 transitions. [2019-11-22 11:01:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 11:01:58,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-22 11:01:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:01:58,065 INFO L225 Difference]: With dead ends: 320 [2019-11-22 11:01:58,065 INFO L226 Difference]: Without dead ends: 320 [2019-11-22 11:01:58,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-22 11:01:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-22 11:01:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-11-22 11:01:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-22 11:01:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 374 transitions. [2019-11-22 11:01:58,080 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 374 transitions. Word has length 18 [2019-11-22 11:01:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:01:58,081 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 374 transitions. [2019-11-22 11:01:58,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-22 11:01:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 374 transitions. [2019-11-22 11:01:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 11:01:58,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:01:58,082 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:01:58,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:01:58,286 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-22 11:01:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:01:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1874416105, now seen corresponding path program 1 times [2019-11-22 11:01:58,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:01:58,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574225146] [2019-11-22 11:01:58,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:01:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:58,662 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-22 11:01:58,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574225146] [2019-11-22 11:01:58,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630289550] [2019-11-22 11:01:58,663 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-22 11:01:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:01:58,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 11:01:58,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:01:58,797 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 23=[|v_#valid_49|]} [2019-11-22 11:01:58,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,845 INFO L343 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2019-11-22 11:01:58,845 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-22 11:01:58,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:58,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:58,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:01:58,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:58,942 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-22 11:01:58,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:01:58,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:59,234 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-22 11:01:59,235 INFO L567 ElimStorePlain]: treesize reduction 1486, result has 6.2 percent of original size [2019-11-22 11:01:59,236 INFO L496 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-22 11:01:59,236 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:135, output treesize:99 [2019-11-22 11:01:59,528 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-22 11:01:59,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:59,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:59,577 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-22 11:01:59,578 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:01:59,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:01:59,616 INFO L496 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-22 11:01:59,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:66 [2019-11-22 11:01:59,688 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-22 11:01:59,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:01:59,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2019-11-22 11:01:59,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20593848] [2019-11-22 11:01:59,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 11:01:59,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:01:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 11:01:59,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:01:59,691 INFO L87 Difference]: Start difference. First operand 263 states and 374 transitions. Second operand 14 states. [2019-11-22 11:01:59,887 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 11:02:00,140 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-11-22 11:02:00,502 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-22 11:02:00,799 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-22 11:02:01,398 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-11-22 11:02:01,792 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-11-22 11:02:02,342 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-11-22 11:02:02,835 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-11-22 11:02:03,357 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 112 [2019-11-22 11:02:03,748 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-11-22 11:02:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:04,576 INFO L93 Difference]: Finished difference Result 310 states and 433 transitions. [2019-11-22 11:02:04,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 11:02:04,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-11-22 11:02:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:04,581 INFO L225 Difference]: With dead ends: 310 [2019-11-22 11:02:04,581 INFO L226 Difference]: Without dead ends: 310 [2019-11-22 11:02:04,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-11-22 11:02:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-22 11:02:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-11-22 11:02:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-22 11:02:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 371 transitions. [2019-11-22 11:02:04,597 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 371 transitions. Word has length 19 [2019-11-22 11:02:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:04,598 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 371 transitions. [2019-11-22 11:02:04,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 11:02:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 371 transitions. [2019-11-22 11:02:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 11:02:04,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:04,600 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-22 11:02:04,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:02:04,804 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-22 11:02:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 550421903, now seen corresponding path program 1 times [2019-11-22 11:02:04,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:04,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502984005] [2019-11-22 11:02:04,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:04,910 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-22 11:02:04,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502984005] [2019-11-22 11:02:04,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:04,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 11:02:04,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300100890] [2019-11-22 11:02:04,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:02:04,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:02:04,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:02:04,912 INFO L87 Difference]: Start difference. First operand 263 states and 371 transitions. Second operand 4 states. [2019-11-22 11:02:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:05,161 INFO L93 Difference]: Finished difference Result 262 states and 369 transitions. [2019-11-22 11:02:05,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:02:05,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-22 11:02:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:05,164 INFO L225 Difference]: With dead ends: 262 [2019-11-22 11:02:05,164 INFO L226 Difference]: Without dead ends: 262 [2019-11-22 11:02:05,165 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-22 11:02:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-22 11:02:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-11-22 11:02:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-22 11:02:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2019-11-22 11:02:05,176 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 23 [2019-11-22 11:02:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:05,177 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2019-11-22 11:02:05,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:02:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2019-11-22 11:02:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 11:02:05,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:05,178 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-22 11:02:05,179 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-22 11:02:05,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash -116790132, now seen corresponding path program 1 times [2019-11-22 11:02:05,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:05,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583595972] [2019-11-22 11:02:05,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:05,258 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-22 11:02:05,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583595972] [2019-11-22 11:02:05,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:05,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 11:02:05,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219386215] [2019-11-22 11:02:05,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:02:05,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:05,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:02:05,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:02:05,260 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 4 states. [2019-11-22 11:02:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:05,492 INFO L93 Difference]: Finished difference Result 195 states and 262 transitions. [2019-11-22 11:02:05,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:02:05,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 11:02:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:05,495 INFO L225 Difference]: With dead ends: 195 [2019-11-22 11:02:05,495 INFO L226 Difference]: Without dead ends: 195 [2019-11-22 11:02:05,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-22 11:02:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-22 11:02:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2019-11-22 11:02:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-22 11:02:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2019-11-22 11:02:05,503 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 24 [2019-11-22 11:02:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:05,503 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2019-11-22 11:02:05,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:02:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2019-11-22 11:02:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 11:02:05,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:05,504 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-22 11:02:05,504 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-22 11:02:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash -29640501, now seen corresponding path program 1 times [2019-11-22 11:02:05,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:05,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445619121] [2019-11-22 11:02:05,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:05,649 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-22 11:02:05,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445619121] [2019-11-22 11:02:05,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:05,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 11:02:05,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854442492] [2019-11-22 11:02:05,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:02:05,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:05,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:02:05,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:02:05,651 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand 4 states. [2019-11-22 11:02:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:06,015 INFO L93 Difference]: Finished difference Result 253 states and 346 transitions. [2019-11-22 11:02:06,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:02:06,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-22 11:02:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:06,018 INFO L225 Difference]: With dead ends: 253 [2019-11-22 11:02:06,018 INFO L226 Difference]: Without dead ends: 253 [2019-11-22 11:02:06,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-22 11:02:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-22 11:02:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 239. [2019-11-22 11:02:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-22 11:02:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 337 transitions. [2019-11-22 11:02:06,030 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 337 transitions. Word has length 24 [2019-11-22 11:02:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:06,030 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 337 transitions. [2019-11-22 11:02:06,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:02:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 337 transitions. [2019-11-22 11:02:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:02:06,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:06,031 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-22 11:02:06,032 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-22 11:02:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:06,032 INFO L82 PathProgramCache]: Analyzing trace with hash -918855488, now seen corresponding path program 1 times [2019-11-22 11:02:06,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:06,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230276669] [2019-11-22 11:02:06,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,127 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-22 11:02:06,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230276669] [2019-11-22 11:02:06,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:06,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-22 11:02:06,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471424849] [2019-11-22 11:02:06,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:02:06,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:06,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:02:06,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:02:06,129 INFO L87 Difference]: Start difference. First operand 239 states and 337 transitions. Second operand 4 states. [2019-11-22 11:02:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:06,523 INFO L93 Difference]: Finished difference Result 257 states and 350 transitions. [2019-11-22 11:02:06,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:02:06,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-22 11:02:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:06,526 INFO L225 Difference]: With dead ends: 257 [2019-11-22 11:02:06,526 INFO L226 Difference]: Without dead ends: 257 [2019-11-22 11:02:06,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:02:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-22 11:02:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2019-11-22 11:02:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-22 11:02:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 339 transitions. [2019-11-22 11:02:06,536 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 339 transitions. Word has length 25 [2019-11-22 11:02:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:06,536 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 339 transitions. [2019-11-22 11:02:06,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:02:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 339 transitions. [2019-11-22 11:02:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:02:06,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:06,537 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-22 11:02:06,538 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-22 11:02:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2138371761, now seen corresponding path program 1 times [2019-11-22 11:02:06,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:06,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756611481] [2019-11-22 11:02:06,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,659 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-22 11:02:06,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756611481] [2019-11-22 11:02:06,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:06,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:02:06,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666676363] [2019-11-22 11:02:06,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 11:02:06,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 11:02:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 11:02:06,661 INFO L87 Difference]: Start difference. First operand 241 states and 339 transitions. Second operand 5 states. [2019-11-22 11:02:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:06,854 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2019-11-22 11:02:06,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 11:02:06,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-22 11:02:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:06,856 INFO L225 Difference]: With dead ends: 202 [2019-11-22 11:02:06,856 INFO L226 Difference]: Without dead ends: 202 [2019-11-22 11:02:06,856 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-22 11:02:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-22 11:02:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2019-11-22 11:02:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-22 11:02:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 263 transitions. [2019-11-22 11:02:06,864 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 263 transitions. Word has length 33 [2019-11-22 11:02:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:06,864 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 263 transitions. [2019-11-22 11:02:06,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 11:02:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 263 transitions. [2019-11-22 11:02:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:02:06,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:06,865 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-22 11:02:06,866 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-22 11:02:06,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:06,866 INFO L82 PathProgramCache]: Analyzing trace with hash -138461554, now seen corresponding path program 1 times [2019-11-22 11:02:06,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:06,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607189624] [2019-11-22 11:02:06,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:07,010 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-22 11:02:07,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607189624] [2019-11-22 11:02:07,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132586307] [2019-11-22 11:02:07,010 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-22 11:02:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:07,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-22 11:02:07,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:02:07,414 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2019-11-22 11:02:07,415 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 11:02:07,415 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-22 11:02:07,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:07,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:07,687 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-11-22 11:02:07,688 INFO L567 ElimStorePlain]: treesize reduction 1301, result has 6.8 percent of original size [2019-11-22 11:02:07,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:07,693 INFO L496 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-22 11:02:07,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:95 [2019-11-22 11:02:07,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:07,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:08,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:08,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:08,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:08,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:08,869 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 74 treesize of output 102 [2019-11-22 11:02:08,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:08,876 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:08,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:08,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:08,927 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 74 treesize of output 102 [2019-11-22 11:02:08,927 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:08,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:08,979 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 74 treesize of output 102 [2019-11-22 11:02:08,980 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:08,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:08,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:08,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:08,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:09,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:09,061 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 79 treesize of output 121 [2019-11-22 11:02:09,062 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:09,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:09,113 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 74 treesize of output 102 [2019-11-22 11:02:09,114 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:09,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:09,168 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 74 treesize of output 102 [2019-11-22 11:02:09,169 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:09,421 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-22 11:02:09,422 INFO L567 ElimStorePlain]: treesize reduction 52, result has 81.0 percent of original size [2019-11-22 11:02:09,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:02:09,425 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:527, output treesize:12 [2019-11-22 11:02:09,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:09,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:10,041 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 11:02:10,137 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-22 11:02:10,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:02:10,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 11:02:10,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251551537] [2019-11-22 11:02:10,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:02:10,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:10,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:02:10,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:02:10,138 INFO L87 Difference]: Start difference. First operand 197 states and 263 transitions. Second operand 12 states. [2019-11-22 11:02:11,554 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 150 DAG size of output: 106 [2019-11-22 11:02:17,950 WARN L192 SmtUtils]: Spent 789.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-22 11:02:32,778 WARN L192 SmtUtils]: Spent 14.73 s on a formula simplification. DAG size of input: 167 DAG size of output: 109 [2019-11-22 11:02:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:53,229 INFO L93 Difference]: Finished difference Result 279 states and 357 transitions. [2019-11-22 11:02:53,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:02:53,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-22 11:02:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:53,232 INFO L225 Difference]: With dead ends: 279 [2019-11-22 11:02:53,233 INFO L226 Difference]: Without dead ends: 279 [2019-11-22 11:02:53,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:02:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-22 11:02:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 245. [2019-11-22 11:02:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-22 11:02:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 333 transitions. [2019-11-22 11:02:53,244 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 333 transitions. Word has length 33 [2019-11-22 11:02:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:53,245 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 333 transitions. [2019-11-22 11:02:53,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:02:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 333 transitions. [2019-11-22 11:02:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 11:02:53,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:53,246 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-22 11:02:53,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:02:53,453 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-22 11:02:53,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:53,453 INFO L82 PathProgramCache]: Analyzing trace with hash -615136466, now seen corresponding path program 1 times [2019-11-22 11:02:53,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:53,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86778929] [2019-11-22 11:02:53,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:53,716 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-22 11:02:53,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86778929] [2019-11-22 11:02:53,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445434252] [2019-11-22 11:02:53,717 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-22 11:02:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:53,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-22 11:02:53,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:02:54,109 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:02:54,110 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:02:54,111 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-22 11:02:54,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,225 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-22 11:02:54,226 INFO L567 ElimStorePlain]: treesize reduction 50, result has 60.9 percent of original size [2019-11-22 11:02:54,431 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 11:02:54,432 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:02:54,432 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-22 11:02:54,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:54,559 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-22 11:02:54,559 INFO L567 ElimStorePlain]: treesize reduction 10, result has 91.5 percent of original size [2019-11-22 11:02:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:54,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,594 INFO L496 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-22 11:02:54,595 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:108 [2019-11-22 11:02:54,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:54,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:54,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:54,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:54,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,681 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:54,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:54,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:54,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:54,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:54,979 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:55,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:55,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:55,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:55,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:55,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:55,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:55,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:55,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:55,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:55,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:55,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:55,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:55,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:55,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:55,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:55,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:55,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,244 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:55,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:55,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:55,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:02:55,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:55,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:55,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:55,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:55,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:55,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:55,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:55,441 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:55,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,567 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 40 treesize of output 58 [2019-11-22 11:02:55,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,675 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 60 treesize of output 130 [2019-11-22 11:02:55,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,733 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,734 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 43 treesize of output 61 [2019-11-22 11:02:55,734 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,803 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 58 treesize of output 98 [2019-11-22 11:02:55,803 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,910 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 65 treesize of output 135 [2019-11-22 11:02:55,912 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,949 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 28 treesize of output 26 [2019-11-22 11:02:55,949 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:55,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:55,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:55,987 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 40 treesize of output 50 [2019-11-22 11:02:55,988 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,011 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,011 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,030 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,031 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,090 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 55 treesize of output 95 [2019-11-22 11:02:56,091 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,110 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,110 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,128 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,128 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,146 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,146 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,165 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,171 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,188 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 60 treesize of output 63 [2019-11-22 11:02:56,189 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,207 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,212 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 40 treesize of output 34 [2019-11-22 11:02:56,212 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,243 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,243 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,261 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,263 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,264 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,266 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 50 treesize of output 39 [2019-11-22 11:02:56,266 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,323 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 50 treesize of output 82 [2019-11-22 11:02:56,324 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,365 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,366 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 45 treesize of output 63 [2019-11-22 11:02:56,366 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,386 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,386 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,404 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,404 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,421 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,421 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,442 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,442 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,505 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 50 treesize of output 82 [2019-11-22 11:02:56,505 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,521 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,522 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,538 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,538 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,555 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,555 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 95 [2019-11-22 11:02:56,615 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,632 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,632 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,673 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,674 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 45 treesize of output 63 [2019-11-22 11:02:56,674 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,698 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,698 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,775 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 70 treesize of output 95 [2019-11-22 11:02:56,776 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,809 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 35 treesize of output 39 [2019-11-22 11:02:56,809 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,852 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,853 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 45 treesize of output 63 [2019-11-22 11:02:56,853 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,872 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,873 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,900 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,901 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,919 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:56,919 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:56,963 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:56,969 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:56,983 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:56,983 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 50 treesize of output 58 [2019-11-22 11:02:56,984 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,006 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,006 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,039 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,040 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,128 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 65 treesize of output 103 [2019-11-22 11:02:57,128 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,156 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,156 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,185 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 50 treesize of output 39 [2019-11-22 11:02:57,186 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,239 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,286 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 70 treesize of output 130 [2019-11-22 11:02:57,287 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,309 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,309 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,352 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 45 treesize of output 63 [2019-11-22 11:02:57,352 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,403 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 55 treesize of output 71 [2019-11-22 11:02:57,403 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,422 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,428 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,443 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,444 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 50 treesize of output 58 [2019-11-22 11:02:57,445 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,463 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,463 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,480 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,480 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,498 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,498 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,559 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 50 treesize of output 82 [2019-11-22 11:02:57,560 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,586 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 35 treesize of output 39 [2019-11-22 11:02:57,587 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,614 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,614 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,632 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,633 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,663 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,664 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 45 treesize of output 47 [2019-11-22 11:02:57,665 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,686 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,686 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,704 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,704 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,734 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,752 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,805 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 70 treesize of output 130 [2019-11-22 11:02:57,806 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,823 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,823 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,851 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 35 treesize of output 39 [2019-11-22 11:02:57,852 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,899 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 55 treesize of output 71 [2019-11-22 11:02:57,900 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:57,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:57,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:57,960 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 50 treesize of output 58 [2019-11-22 11:02:57,960 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:57,981 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:57,981 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,002 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,002 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,038 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,039 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 40 treesize of output 50 [2019-11-22 11:02:58,039 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,067 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,073 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 55 treesize of output 52 [2019-11-22 11:02:58,074 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,093 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,094 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,111 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,111 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,127 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,127 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,149 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,169 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 50 treesize of output 58 [2019-11-22 11:02:58,169 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,186 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,187 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,211 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,212 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,220 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,221 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,235 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 65 treesize of output 76 [2019-11-22 11:02:58,236 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,256 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,256 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,276 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,277 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,294 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,295 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,313 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,314 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,352 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 40 treesize of output 50 [2019-11-22 11:02:58,353 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,406 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,429 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 60 treesize of output 63 [2019-11-22 11:02:58,430 INFO L496 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,453 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 55 treesize of output 52 [2019-11-22 11:02:58,454 INFO L496 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,468 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,471 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,471 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,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, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-11-22 11:02:58,474 INFO L496 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,488 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,488 INFO L496 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,514 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,515 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,529 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 60 treesize of output 63 [2019-11-22 11:02:58,529 INFO L496 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,553 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 35 treesize of output 39 [2019-11-22 11:02:58,554 INFO L496 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:58,572 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 30 treesize of output 26 [2019-11-22 11:02:58,572 INFO L496 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,585 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,586 INFO L496 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,605 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,607 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 45 treesize of output 36 [2019-11-22 11:02:58,607 INFO L496 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,621 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,621 INFO L496 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,636 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,636 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,639 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,640 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,646 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 65 treesize of output 57 [2019-11-22 11:02:58,646 INFO L496 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,658 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,659 INFO L496 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,673 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,674 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,684 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,684 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 55 treesize of output 52 [2019-11-22 11:02:58,685 INFO L496 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,697 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,698 INFO L496 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,715 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,715 INFO L496 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,732 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,732 INFO L496 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,745 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,745 INFO L496 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,759 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,760 INFO L496 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,778 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,778 INFO L496 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,790 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,790 INFO L496 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,803 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,803 INFO L496 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,818 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,822 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 65 treesize of output 46 [2019-11-22 11:02:58,823 INFO L496 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,834 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,835 INFO L496 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,849 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,850 INFO L496 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,863 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,863 INFO L496 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,889 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 55 treesize of output 52 [2019-11-22 11:02:58,889 INFO L496 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,902 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,902 INFO L496 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,914 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,914 INFO L496 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,926 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,926 INFO L496 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,938 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,938 INFO L496 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,951 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:58,951 INFO L496 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:58,965 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,966 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,968 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,969 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,970 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,971 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,983 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:58,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:58,988 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 75 treesize of output 62 [2019-11-22 11:02:58,989 INFO L496 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,001 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,001 INFO L496 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,013 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,013 INFO L496 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,024 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,024 INFO L496 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,039 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,039 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 45 treesize of output 36 [2019-11-22 11:02:59,039 INFO L496 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,051 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,051 INFO L496 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,060 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,061 INFO L496 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,072 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,072 INFO L496 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,083 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,084 INFO L496 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,096 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,096 INFO L496 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,108 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,108 INFO L496 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,121 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,121 INFO L496 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,133 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,134 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,134 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,136 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 45 treesize of output 36 [2019-11-22 11:02:59,136 INFO L496 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,147 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,148 INFO L496 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,160 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 25 treesize of output 23 [2019-11-22 11:02:59,160 INFO L496 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,172 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,172 INFO L496 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,184 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,184 INFO L496 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,195 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,195 INFO L496 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,205 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,205 INFO L496 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,216 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,217 INFO L496 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,232 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,233 INFO L496 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,243 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,244 INFO L496 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,254 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,255 INFO L496 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,266 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,266 INFO L496 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,275 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,275 INFO L496 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,285 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,285 INFO L496 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,296 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,296 INFO L496 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,307 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,307 INFO L496 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,319 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,319 INFO L496 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,329 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,329 INFO L496 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,339 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,339 INFO L496 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,348 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,348 INFO L496 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,361 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,361 INFO L496 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,388 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,388 INFO L496 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,398 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,398 INFO L496 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,425 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,425 INFO L496 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,434 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,434 INFO L496 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,442 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,442 INFO L496 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,452 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,452 INFO L496 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,462 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,462 INFO L496 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,471 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:02:59,471 INFO L496 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,610 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-11-22 11:02:59,611 INFO L567 ElimStorePlain]: treesize reduction 812, result has 4.8 percent of original size [2019-11-22 11:02:59,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,622 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 20 treesize of output 24 [2019-11-22 11:02:59,622 INFO L496 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,625 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:02:59,627 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 20 treesize of output 13 [2019-11-22 11:02:59,628 INFO L496 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,656 INFO L567 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-22 11:02:59,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,656 INFO L221 ElimStorePlain]: Needed 153 recursive calls to eliminate 7 variables, input treesize:7491, output treesize:10 [2019-11-22 11:02:59,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:02:59,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:59,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:59,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-22 11:02:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-22 11:02:59,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-22 11:02:59,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:02:59,725 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-22 11:02:59,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,912 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 60 treesize of output 144 [2019-11-22 11:02:59,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:02:59,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:02:59,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:02:59,996 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 55 treesize of output 101 [2019-11-22 11:02:59,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,078 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 58 treesize of output 104 [2019-11-22 11:03:00,079 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:00,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,172 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 63 treesize of output 104 [2019-11-22 11:03:00,173 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,341 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 75 treesize of output 189 [2019-11-22 11:03:00,342 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,377 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,378 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 38 treesize of output 48 [2019-11-22 11:03:00,379 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,409 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:00,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,420 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 43 treesize of output 48 [2019-11-22 11:03:00,421 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:00,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,515 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 63 treesize of output 104 [2019-11-22 11:03:00,516 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,555 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:00,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,579 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 53 treesize of output 72 [2019-11-22 11:03:00,579 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:00,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,652 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 53 treesize of output 72 [2019-11-22 11:03:00,652 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,693 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,693 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 38 treesize of output 48 [2019-11-22 11:03:00,694 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,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, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:03:00,823 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:00,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,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 43 treesize of output 48 [2019-11-22 11:03:00,865 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:00,944 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 58 treesize of output 104 [2019-11-22 11:03:00,945 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:00,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:00,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,028 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 55 treesize of output 101 [2019-11-22 11:03:01,029 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,154 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 65 treesize of output 141 [2019-11-22 11:03:01,155 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,212 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 45 treesize of output 69 [2019-11-22 11:03:01,213 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:01,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,305 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 63 treesize of output 104 [2019-11-22 11:03:01,306 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:01,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,398 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 63 treesize of output 104 [2019-11-22 11:03:01,399 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,458 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 45 treesize of output 69 [2019-11-22 11:03:01,458 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,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 6 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 141 [2019-11-22 11:03:01,578 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,669 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 50 treesize of output 104 [2019-11-22 11:03:01,670 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,757 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:01,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,816 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 73 treesize of output 144 [2019-11-22 11:03:01,817 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:01,937 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 65 treesize of output 141 [2019-11-22 11:03:01,938 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:01,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:01,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,004 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 45 treesize of output 69 [2019-11-22 11:03:02,005 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,184 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 70 treesize of output 192 [2019-11-22 11:03:02,185 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 11:03:02,244 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:02,314 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,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 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 72 [2019-11-22 11:03:02,315 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:02,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,443 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 63 treesize of output 104 [2019-11-22 11:03:02,443 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,566 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 65 treesize of output 141 [2019-11-22 11:03:02,566 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 11:03:02,605 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,686 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 58 treesize of output 104 [2019-11-22 11:03:02,687 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 72 [2019-11-22 11:03:02,744 INFO L496 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,809 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 48 treesize of output 72 [2019-11-22 11:03:02,810 INFO L496 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:02,892 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 55 treesize of output 101 [2019-11-22 11:03:02,893 INFO L496 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:02,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:02,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,053 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 75 treesize of output 189 [2019-11-22 11:03:03,054 INFO L496 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,137 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,137 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 58 treesize of output 104 [2019-11-22 11:03:03,138 INFO L496 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,194 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 45 treesize of output 69 [2019-11-22 11:03:03,195 INFO L496 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,314 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 68 treesize of output 144 [2019-11-22 11:03:03,315 INFO L496 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,403 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 58 treesize of output 104 [2019-11-22 11:03:03,404 INFO L496 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,492 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 58 treesize of output 104 [2019-11-22 11:03:03,492 INFO L496 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,573 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:03,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,627 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 73 treesize of output 144 [2019-11-22 11:03:03,628 INFO L496 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,666 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 38 treesize of output 48 [2019-11-22 11:03:03,666 INFO L496 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,795 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 68 treesize of output 144 [2019-11-22 11:03:03,796 INFO L496 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2019-11-22 11:03:03,835 INFO L496 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:03,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 5 new quantified variables, introduced 7 case distinctions, treesize of input 58 treesize of output 104 [2019-11-22 11:03:03,919 INFO L496 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:03,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:03,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,005 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 55 treesize of output 101 [2019-11-22 11:03:04,006 INFO L496 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,132 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 60 treesize of output 144 [2019-11-22 11:03:04,134 INFO L496 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,213 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 58 treesize of output 104 [2019-11-22 11:03:04,214 INFO L496 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,254 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 35 treesize of output 45 [2019-11-22 11:03:04,254 INFO L496 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,306 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:04,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,346 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 63 treesize of output 104 [2019-11-22 11:03:04,347 INFO L496 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,470 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,470 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 65 treesize of output 141 [2019-11-22 11:03:04,471 INFO L496 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,602 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,603 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 60 treesize of output 144 [2019-11-22 11:03:04,604 INFO L496 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,780 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 75 treesize of output 189 [2019-11-22 11:03:04,781 INFO L496 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,848 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,849 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 48 treesize of output 72 [2019-11-22 11:03:04,850 INFO L496 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:04,909 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 48 treesize of output 72 [2019-11-22 11:03:04,910 INFO L496 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:04,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:04,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,042 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 60 treesize of output 144 [2019-11-22 11:03:05,043 INFO L496 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,173 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 68 treesize of output 144 [2019-11-22 11:03:05,174 INFO L496 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,265 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 50 treesize of output 104 [2019-11-22 11:03:05,265 INFO L496 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,413 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 60 treesize of output 144 [2019-11-22 11:03:05,415 INFO L496 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,470 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:05,509 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,510 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 63 treesize of output 104 [2019-11-22 11:03:05,511 INFO L496 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,598 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 55 treesize of output 101 [2019-11-22 11:03:05,599 INFO L496 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:05,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,646 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 43 treesize of output 48 [2019-11-22 11:03:05,646 INFO L496 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:05,732 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,732 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 63 treesize of output 104 [2019-11-22 11:03:05,732 INFO L496 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:05,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,803 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 53 treesize of output 72 [2019-11-22 11:03:05,804 INFO L496 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,888 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 55 treesize of output 101 [2019-11-22 11:03:05,889 INFO L496 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:05,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:05,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:05,979 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 58 treesize of output 104 [2019-11-22 11:03:05,979 INFO L496 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:06,065 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 55 treesize of output 101 [2019-11-22 11:03:06,066 INFO L496 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:06,158 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 50 treesize of output 104 [2019-11-22 11:03:06,159 INFO L496 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,282 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:06,283 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 65 treesize of output 141 [2019-11-22 11:03:06,284 INFO L496 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:06,407 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 65 treesize of output 141 [2019-11-22 11:03:06,408 INFO L496 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:06,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, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 60 treesize of output 144 [2019-11-22 11:03:06,537 INFO L496 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,595 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:06,595 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 48 treesize of output 72 [2019-11-22 11:03:06,596 INFO L496 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:06,776 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 70 treesize of output 192 [2019-11-22 11:03:06,777 INFO L496 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:06,911 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 45 treesize of output 69 [2019-11-22 11:03:06,911 INFO L496 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:06,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:06,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,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, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 101 [2019-11-22 11:03:07,005 INFO L496 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,052 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:07,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,069 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 53 treesize of output 72 [2019-11-22 11:03:07,070 INFO L496 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,128 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 48 treesize of output 72 [2019-11-22 11:03:07,129 INFO L496 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:07,214 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,214 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 63 treesize of output 104 [2019-11-22 11:03:07,215 INFO L496 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,272 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 48 treesize of output 72 [2019-11-22 11:03:07,272 INFO L496 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,395 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,396 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 65 treesize of output 141 [2019-11-22 11:03:07,397 INFO L496 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:07,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,485 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 53 treesize of output 72 [2019-11-22 11:03:07,486 INFO L496 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,645 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 75 treesize of output 189 [2019-11-22 11:03:07,646 INFO L496 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,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 55 treesize of output 101 [2019-11-22 11:03:07,726 INFO L496 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:07,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,866 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 73 treesize of output 144 [2019-11-22 11:03:07,867 INFO L496 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:07,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,904 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 43 treesize of output 48 [2019-11-22 11:03:07,904 INFO L496 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:07,941 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,942 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 43 treesize of output 48 [2019-11-22 11:03:07,943 INFO L496 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:07,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:07,977 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:07,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:07,998 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 53 treesize of output 72 [2019-11-22 11:03:07,998 INFO L496 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:08,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,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, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 104 [2019-11-22 11:03:08,084 INFO L496 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,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 45 treesize of output 69 [2019-11-22 11:03:08,136 INFO L496 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,303 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 70 treesize of output 192 [2019-11-22 11:03:08,305 INFO L496 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:08,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,361 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 53 treesize of output 72 [2019-11-22 11:03:08,361 INFO L496 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,475 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 65 treesize of output 141 [2019-11-22 11:03:08,476 INFO L496 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,502 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:08,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,515 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 43 treesize of output 48 [2019-11-22 11:03:08,516 INFO L496 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,605 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 50 treesize of output 104 [2019-11-22 11:03:08,606 INFO L496 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,696 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 50 treesize of output 104 [2019-11-22 11:03:08,697 INFO L496 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,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, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 104 [2019-11-22 11:03:08,792 INFO L496 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:08,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,851 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 53 treesize of output 72 [2019-11-22 11:03:08,851 INFO L496 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,930 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 58 treesize of output 104 [2019-11-22 11:03:08,931 INFO L496 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,950 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:08,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,956 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 33 treesize of output 32 [2019-11-22 11:03:08,956 INFO L496 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:08,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:08,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:08,990 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:08,991 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:08,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:08,997 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 53 treesize of output 48 [2019-11-22 11:03:08,997 INFO L496 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,019 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,023 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 38 treesize of output 32 [2019-11-22 11:03:09,023 INFO L496 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,108 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 55 treesize of output 101 [2019-11-22 11:03:09,109 INFO L496 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 72 [2019-11-22 11:03:09,173 INFO L496 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,255 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 68 treesize of output 104 [2019-11-22 11:03:09,255 INFO L496 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,298 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 30 treesize of output 48 [2019-11-22 11:03:09,298 INFO L496 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,386 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,386 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 68 treesize of output 104 [2019-11-22 11:03:09,387 INFO L496 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,413 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,430 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,467 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 65 treesize of output 101 [2019-11-22 11:03:09,468 INFO L496 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,510 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 40 treesize of output 48 [2019-11-22 11:03:09,511 INFO L496 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,535 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,542 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,549 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 53 treesize of output 48 [2019-11-22 11:03:09,550 INFO L496 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,588 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,607 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 55 treesize of output 69 [2019-11-22 11:03:09,607 INFO L496 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,631 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 43 treesize of output 32 [2019-11-22 11:03:09,631 INFO L496 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,652 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,666 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 53 treesize of output 48 [2019-11-22 11:03:09,666 INFO L496 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,696 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,697 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,704 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 53 treesize of output 48 [2019-11-22 11:03:09,705 INFO L496 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,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, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2019-11-22 11:03:09,763 INFO L496 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,823 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,888 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 70 treesize of output 144 [2019-11-22 11:03:09,890 INFO L496 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:09,923 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:09,977 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:09,978 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 60 treesize of output 104 [2019-11-22 11:03:09,978 INFO L496 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:09,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,019 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,036 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 55 treesize of output 69 [2019-11-22 11:03:10,037 INFO L496 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,079 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,215 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 80 treesize of output 192 [2019-11-22 11:03:10,216 INFO L496 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,273 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 58 treesize of output 72 [2019-11-22 11:03:10,274 INFO L496 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,304 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,359 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 65 treesize of output 101 [2019-11-22 11:03:10,359 INFO L496 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,390 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,425 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 50 treesize of output 72 [2019-11-22 11:03:10,425 INFO L496 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,460 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,486 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,486 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 50 treesize of output 72 [2019-11-22 11:03:10,487 INFO L496 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,517 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,525 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 48 treesize of output 48 [2019-11-22 11:03:10,526 INFO L496 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,649 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 75 treesize of output 141 [2019-11-22 11:03:10,650 INFO L496 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,729 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 55 treesize of output 69 [2019-11-22 11:03:10,729 INFO L496 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,748 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 33 treesize of output 24 [2019-11-22 11:03:10,748 INFO L496 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,788 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,803 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 63 treesize of output 72 [2019-11-22 11:03:10,804 INFO L496 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,865 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 50 treesize of output 72 [2019-11-22 11:03:10,865 INFO L496 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,908 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 40 treesize of output 48 [2019-11-22 11:03:10,908 INFO L496 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,927 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,928 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 28 treesize of output 24 [2019-11-22 11:03:10,928 INFO L496 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,960 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:10,966 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 53 treesize of output 48 [2019-11-22 11:03:10,966 INFO L496 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:10,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:10,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,991 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:10,992 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 43 treesize of output 32 [2019-11-22 11:03:10,993 INFO L496 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,028 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,046 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,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, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:03:11,047 INFO L496 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,073 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,105 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 58 treesize of output 72 [2019-11-22 11:03:11,105 INFO L496 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,136 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,142 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 53 treesize of output 48 [2019-11-22 11:03:11,143 INFO L496 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,223 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 68 treesize of output 104 [2019-11-22 11:03:11,223 INFO L496 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,247 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,259 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,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, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 72 [2019-11-22 11:03:11,279 INFO L496 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,304 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,316 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,337 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 55 treesize of output 69 [2019-11-22 11:03:11,338 INFO L496 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,365 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,399 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 63 treesize of output 72 [2019-11-22 11:03:11,399 INFO L496 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,462 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,529 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 70 treesize of output 144 [2019-11-22 11:03:11,530 INFO L496 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,587 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 50 treesize of output 72 [2019-11-22 11:03:11,588 INFO L496 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,624 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 53 treesize of output 48 [2019-11-22 11:03:11,625 INFO L496 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,668 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 40 treesize of output 48 [2019-11-22 11:03:11,669 INFO L496 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,689 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,692 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 43 treesize of output 32 [2019-11-22 11:03:11,693 INFO L496 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,735 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,739 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 48 treesize of output 48 [2019-11-22 11:03:11,739 INFO L496 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,764 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,771 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,777 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 48 treesize of output 48 [2019-11-22 11:03:11,778 INFO L496 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,800 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,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, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-11-22 11:03:11,813 INFO L496 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,895 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 65 treesize of output 101 [2019-11-22 11:03:11,895 INFO L496 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,927 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,945 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,975 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 73 treesize of output 104 [2019-11-22 11:03:11,976 INFO L496 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:11,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:11,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,012 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 40 treesize of output 48 [2019-11-22 11:03:12,013 INFO L496 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,034 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,040 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,046 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,046 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 45 treesize of output 45 [2019-11-22 11:03:12,046 INFO L496 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,074 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,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, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-11-22 11:03:12,103 INFO L496 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,134 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,187 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,187 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 60 treesize of output 104 [2019-11-22 11:03:12,188 INFO L496 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,253 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,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 78 treesize of output 144 [2019-11-22 11:03:12,313 INFO L496 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,350 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,428 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,429 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 65 treesize of output 101 [2019-11-22 11:03:12,430 INFO L496 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,449 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,462 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 48 treesize of output 48 [2019-11-22 11:03:12,463 INFO L496 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,537 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 65 treesize of output 101 [2019-11-22 11:03:12,538 INFO L496 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,559 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,574 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,617 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 60 treesize of output 104 [2019-11-22 11:03:12,618 INFO L496 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:03:12,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:03:12,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,653 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 55 treesize of output 69 [2019-11-22 11:03:12,654 INFO L496 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:13,120 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 16 [2019-11-22 11:03:13,121 INFO L567 ElimStorePlain]: treesize reduction 4167, result has 0.5 percent of original size [2019-11-22 11:03:13,127 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-22 11:03:13,127 INFO L496 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:13,140 INFO L567 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-22 11:03:13,141 INFO L496 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-22 11:03:13,141 INFO L221 ElimStorePlain]: Needed 162 recursive calls to eliminate 8 variables, input treesize:8863, output treesize:14 [2019-11-22 11:03:13,215 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-22 11:03:13,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:13,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2019-11-22 11:03:13,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507644901] [2019-11-22 11:03:13,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-22 11:03:13,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-22 11:03:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-22 11:03:13,217 INFO L87 Difference]: Start difference. First operand 245 states and 333 transitions. Second operand 19 states. [2019-11-22 11:03:13,840 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-11-22 11:03:23,608 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-22 11:03:33,105 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-22 11:03:43,125 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-11-22 11:03:43,403 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-22 11:03:43,595 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-22 11:04:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:45,763 INFO L93 Difference]: Finished difference Result 387 states and 520 transitions. [2019-11-22 11:04:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-22 11:04:45,764 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-11-22 11:04:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:45,767 INFO L225 Difference]: With dead ends: 387 [2019-11-22 11:04:45,767 INFO L226 Difference]: Without dead ends: 387 [2019-11-22 11:04:45,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=441, Invalid=1199, Unknown=0, NotChecked=0, Total=1640 [2019-11-22 11:04:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-22 11:04:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 319. [2019-11-22 11:04:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-22 11:04:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 441 transitions. [2019-11-22 11:04:45,782 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 441 transitions. Word has length 35 [2019-11-22 11:04:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:45,783 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 441 transitions. [2019-11-22 11:04:45,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-22 11:04:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 441 transitions. [2019-11-22 11:04:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 11:04:45,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:45,784 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-22 11:04:46,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:04:46,011 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-22 11:04:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2659210, now seen corresponding path program 1 times [2019-11-22 11:04:46,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:46,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636514766] [2019-11-22 11:04:46,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:46,277 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-22 11:04:46,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636514766] [2019-11-22 11:04:46,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177719827] [2019-11-22 11:04:46,278 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-22 11:04:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:46,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 11:04:46,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:04:46,424 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 5=[|v_#valid_53|]} [2019-11-22 11:04:46,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:46,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:46,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:46,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:46,627 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-22 11:04:46,628 INFO L343 Elim1Store]: treesize reduction 108, result has 47.1 percent of original size [2019-11-22 11:04:46,628 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-22 11:04:46,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:46,736 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-11-22 11:04:46,736 INFO L567 ElimStorePlain]: treesize reduction 50, result has 59.7 percent of original size [2019-11-22 11:04:46,754 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-22 11:04:46,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-22 11:04:46,845 INFO L567 ElimStorePlain]: treesize reduction 26, result has 72.9 percent of original size [2019-11-22 11:04:46,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,866 INFO L496 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-22 11:04:46,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:45, output treesize:70 [2019-11-22 11:04:46,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:47,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,638 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 39 treesize of output 55 [2019-11-22 11:04:47,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,703 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,704 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 48 treesize of output 86 [2019-11-22 11:04:47,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,743 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 39 treesize of output 55 [2019-11-22 11:04:47,744 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,784 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,784 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 39 treesize of output 55 [2019-11-22 11:04:47,785 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,804 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 30 treesize of output 32 [2019-11-22 11:04:47,804 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:47,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:47,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:47,815 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:47,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,824 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 48 treesize of output 40 [2019-11-22 11:04:47,824 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,830 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:47,830 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,858 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 39 treesize of output 55 [2019-11-22 11:04:47,858 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,874 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 30 treesize of output 32 [2019-11-22 11:04:47,875 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,880 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:47,880 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:47,892 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:47,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,899 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 39 treesize of output 39 [2019-11-22 11:04:47,899 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:47,911 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 30 treesize of output 32 [2019-11-22 11:04:47,912 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,916 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:47,916 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,923 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 21 treesize of output 17 [2019-11-22 11:04:47,923 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,926 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:47,927 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,931 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:47,931 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,935 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:47,936 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,984 INFO L567 ElimStorePlain]: treesize reduction 224, result has 4.7 percent of original size [2019-11-22 11:04:47,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:04:47,985 INFO L221 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:669, output treesize:7 [2019-11-22 11:04:47,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:48,387 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-11-22 11:04:48,441 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-22 11:04:48,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:04:48,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 12 [2019-11-22 11:04:48,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590116322] [2019-11-22 11:04:48,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 11:04:48,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:48,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 11:04:48,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:04:48,444 INFO L87 Difference]: Start difference. First operand 319 states and 441 transitions. Second operand 13 states. [2019-11-22 11:04:48,679 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-11-22 11:04:49,379 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2019-11-22 11:04:49,703 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2019-11-22 11:04:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:50,286 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2019-11-22 11:04:50,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:04:50,286 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-22 11:04:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:50,288 INFO L225 Difference]: With dead ends: 331 [2019-11-22 11:04:50,289 INFO L226 Difference]: Without dead ends: 329 [2019-11-22 11:04:50,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:04:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-22 11:04:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2019-11-22 11:04:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-22 11:04:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 436 transitions. [2019-11-22 11:04:50,311 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 436 transitions. Word has length 34 [2019-11-22 11:04:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:50,312 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 436 transitions. [2019-11-22 11:04:50,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 11:04:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 436 transitions. [2019-11-22 11:04:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 11:04:50,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:50,314 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-22 11:04:50,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:04:50,518 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-22 11:04:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1559342765, now seen corresponding path program 1 times [2019-11-22 11:04:50,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:50,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533601876] [2019-11-22 11:04:50,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:51,274 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-22 11:04:51,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533601876] [2019-11-22 11:04:51,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073866315] [2019-11-22 11:04:51,275 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-22 11:04:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:51,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 11:04:51,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:04:51,585 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-22 11:04:51,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:51,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:51,600 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-22 11:04:51,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:51,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:51,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:04:51,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-22 11:04:51,675 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:51,676 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-22 11:04:51,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:51,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:51,690 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-22 11:04:51,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:51,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:51,702 INFO L496 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-22 11:04:51,703 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-22 11:04:51,786 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-22 11:04:51,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:51,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:51,801 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-22 11:04:51,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:51,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:51,810 INFO L496 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-22 11:04:51,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-22 11:04:51,849 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-22 11:04:51,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:04:51,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 26 [2019-11-22 11:04:51,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375213294] [2019-11-22 11:04:51,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-22 11:04:51,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-22 11:04:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-11-22 11:04:51,852 INFO L87 Difference]: Start difference. First operand 317 states and 436 transitions. Second operand 27 states. [2019-11-22 11:04:52,157 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-22 11:04:52,360 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2019-11-22 11:04:53,296 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-22 11:04:53,526 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2019-11-22 11:04:53,874 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-11-22 11:04:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:54,969 INFO L93 Difference]: Finished difference Result 361 states and 488 transitions. [2019-11-22 11:04:54,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-22 11:04:54,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-11-22 11:04:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:54,974 INFO L225 Difference]: With dead ends: 361 [2019-11-22 11:04:54,974 INFO L226 Difference]: Without dead ends: 361 [2019-11-22 11:04:54,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2019-11-22 11:04:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-22 11:04:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 318. [2019-11-22 11:04:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-22 11:04:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 433 transitions. [2019-11-22 11:04:54,989 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 433 transitions. Word has length 37 [2019-11-22 11:04:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:54,991 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 433 transitions. [2019-11-22 11:04:54,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-22 11:04:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 433 transitions. [2019-11-22 11:04:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-22 11:04:54,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:54,992 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-22 11:04:55,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:04:55,201 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-22 11:04:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1566995341, now seen corresponding path program 1 times [2019-11-22 11:04:55,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:55,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978192423] [2019-11-22 11:04:55,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:55,376 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-22 11:04:55,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978192423] [2019-11-22 11:04:55,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:04:55,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 11:04:55,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020394275] [2019-11-22 11:04:55,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:04:55,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:04:55,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:04:55,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:04:55,379 INFO L87 Difference]: Start difference. First operand 318 states and 433 transitions. Second operand 9 states. [2019-11-22 11:04:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:04:55,829 INFO L93 Difference]: Finished difference Result 316 states and 409 transitions. [2019-11-22 11:04:55,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:04:55,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-11-22 11:04:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:04:55,833 INFO L225 Difference]: With dead ends: 316 [2019-11-22 11:04:55,833 INFO L226 Difference]: Without dead ends: 316 [2019-11-22 11:04:55,834 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-22 11:04:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-22 11:04:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2019-11-22 11:04:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-22 11:04:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 390 transitions. [2019-11-22 11:04:55,844 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 390 transitions. Word has length 46 [2019-11-22 11:04:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:04:55,844 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 390 transitions. [2019-11-22 11:04:55,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:04:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 390 transitions. [2019-11-22 11:04:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-22 11:04:55,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:04:55,845 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-22 11:04:55,846 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-22 11:04:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:04:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash -415186385, now seen corresponding path program 1 times [2019-11-22 11:04:55,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:04:55,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418536384] [2019-11-22 11:04:55,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:04:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:56,523 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-22 11:04:56,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418536384] [2019-11-22 11:04:56,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414394482] [2019-11-22 11:04:56,524 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-22 11:04:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:04:56,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-22 11:04:56,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:04:56,695 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 8=[|v_#valid_55|]} [2019-11-22 11:04:56,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:56,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:56,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:56,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:56,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:56,886 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-11-22 11:04:56,886 INFO L343 Elim1Store]: treesize reduction 86, result has 52.7 percent of original size [2019-11-22 11:04:56,887 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-22 11:04:56,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:57,045 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-22 11:04:57,046 INFO L567 ElimStorePlain]: treesize reduction 50, result has 68.6 percent of original size [2019-11-22 11:04:57,068 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:57,069 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-22 11:04:57,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-22 11:04:57,238 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-22 11:04:57,238 INFO L567 ElimStorePlain]: treesize reduction 147, result has 40.0 percent of original size [2019-11-22 11:04:57,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,256 INFO L496 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-22 11:04:57,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:80, output treesize:98 [2019-11-22 11:04:57,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:57,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:57,749 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 76 treesize of output 106 [2019-11-22 11:04:57,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:57,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:57,776 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 67 treesize of output 75 [2019-11-22 11:04:57,777 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:57,797 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 65 treesize of output 59 [2019-11-22 11:04:57,797 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:57,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:57,881 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 81 treesize of output 149 [2019-11-22 11:04:57,882 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:57,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:57,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:57,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:57,909 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:57,910 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 76 treesize of output 82 [2019-11-22 11:04:57,911 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:57,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:57,965 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 76 treesize of output 106 [2019-11-22 11:04:57,966 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:57,973 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:57,973 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:57,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:58,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:58,017 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 76 treesize of output 98 [2019-11-22 11:04:58,018 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:58,026 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:58,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:04:58,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:58,048 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 79 treesize of output 85 [2019-11-22 11:04:58,048 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:58,060 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 65 treesize of output 59 [2019-11-22 11:04:58,061 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:58,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:58,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:58,081 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 67 treesize of output 67 [2019-11-22 11:04:58,082 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:58,087 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:58,087 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:58,091 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:04:58,092 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:58,287 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-22 11:04:58,288 INFO L567 ElimStorePlain]: treesize reduction 297, result has 33.0 percent of original size [2019-11-22 11:04:58,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:04:58,289 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:951, output treesize:67 [2019-11-22 11:04:58,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:58,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:04:59,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:59,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:59,615 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 66 treesize of output 192 [2019-11-22 11:04:59,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:59,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:59,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:59,679 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 48 treesize of output 100 [2019-11-22 11:04:59,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:59,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:59,786 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:59,787 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 57 treesize of output 142 [2019-11-22 11:04:59,788 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:59,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:04:59,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:04:59,941 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 66 treesize of output 192 [2019-11-22 11:04:59,942 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:04:59,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:00,116 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 11:05:00,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:00,117 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 58 treesize of output 200 [2019-11-22 11:05:00,118 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:00,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:00,325 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-22 11:05:00,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:00,326 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 79 treesize of output 246 [2019-11-22 11:05:00,328 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:00,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:00,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:00,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, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 142 [2019-11-22 11:05:00,434 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:00,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:00,555 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:00,556 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 57 treesize of output 142 [2019-11-22 11:05:00,557 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:00,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:00,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:00,707 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 70 treesize of output 188 [2019-11-22 11:05:00,709 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:00,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:00,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:00,777 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 48 treesize of output 100 [2019-11-22 11:05:00,778 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:00,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:00,928 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:00,928 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 70 treesize of output 188 [2019-11-22 11:05:00,930 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:00,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:01,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:01,036 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 57 treesize of output 142 [2019-11-22 11:05:01,037 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:05:01,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:01,115 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 61 treesize of output 138 [2019-11-22 11:05:01,116 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,700 WARN L192 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 95 [2019-11-22 11:05:01,701 INFO L567 ElimStorePlain]: treesize reduction 1334, result has 20.7 percent of original size [2019-11-22 11:05:01,707 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 55 treesize of output 51 [2019-11-22 11:05:01,708 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,715 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 55 treesize of output 51 [2019-11-22 11:05:01,716 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,724 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 85 treesize of output 81 [2019-11-22 11:05:01,724 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,732 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 76 treesize of output 72 [2019-11-22 11:05:01,733 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,739 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 76 treesize of output 72 [2019-11-22 11:05:01,739 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,915 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-22 11:05:01,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:01,923 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 48 treesize of output 44 [2019-11-22 11:05:01,924 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,931 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 69 treesize of output 65 [2019-11-22 11:05:01,931 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,939 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 69 treesize of output 65 [2019-11-22 11:05:01,939 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,946 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 48 treesize of output 44 [2019-11-22 11:05:01,947 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:01,952 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 78 treesize of output 74 [2019-11-22 11:05:01,952 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:05:02,115 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-22 11:05:02,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:05:02,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,135 INFO L496 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-22 11:05:02,136 INFO L221 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:795, output treesize:278 [2019-11-22 11:05:02,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,396 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 64 [2019-11-22 11:05:02,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:05:02,701 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-11-22 11:05:02,863 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-22 11:05:02,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:05:02,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-11-22 11:05:02,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864808125] [2019-11-22 11:05:02,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 11:05:02,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:05:02,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 11:05:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2019-11-22 11:05:02,867 INFO L87 Difference]: Start difference. First operand 301 states and 390 transitions. Second operand 23 states. [2019-11-22 11:05:04,009 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-11-22 11:05:04,419 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2019-11-22 11:05:04,584 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-22 11:05:04,963 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 135 [2019-11-22 11:05:06,247 WARN L192 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 141 [2019-11-22 11:05:24,818 WARN L192 SmtUtils]: Spent 6.86 s on a formula simplification. DAG size of input: 226 DAG size of output: 184 [2019-11-22 11:05:28,823 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-22 11:05:33,633 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 139 [2019-11-22 11:05:52,748 WARN L192 SmtUtils]: Spent 6.50 s on a formula simplification. DAG size of input: 217 DAG size of output: 180 [2019-11-22 11:06:09,336 WARN L192 SmtUtils]: Spent 4.75 s on a formula simplification. DAG size of input: 230 DAG size of output: 188 [2019-11-22 11:06:13,222 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 148 [2019-11-22 11:06:17,891 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2019-11-22 11:06:28,907 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-22 11:06:29,950 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2019-11-22 11:06:40,188 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2019-11-22 11:06:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:42,156 INFO L93 Difference]: Finished difference Result 385 states and 454 transitions. [2019-11-22 11:06:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-22 11:06:42,157 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-22 11:06:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:42,159 INFO L225 Difference]: With dead ends: 385 [2019-11-22 11:06:42,159 INFO L226 Difference]: Without dead ends: 385 [2019-11-22 11:06:42,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=467, Invalid=1502, Unknown=11, NotChecked=0, Total=1980 [2019-11-22 11:06:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-22 11:06:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 334. [2019-11-22 11:06:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-22 11:06:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 410 transitions. [2019-11-22 11:06:42,170 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 410 transitions. Word has length 39 [2019-11-22 11:06:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:42,171 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 410 transitions. [2019-11-22 11:06:42,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 11:06:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 410 transitions. [2019-11-22 11:06:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-22 11:06:42,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:42,172 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-22 11:06:42,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:42,384 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-22 11:06:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1604386484, now seen corresponding path program 1 times [2019-11-22 11:06:42,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:42,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655534007] [2019-11-22 11:06:42,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:43,172 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-22 11:06:43,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655534007] [2019-11-22 11:06:43,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413506894] [2019-11-22 11:06:43,173 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-22 11:06:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:43,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-22 11:06:43,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:43,328 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 15=[|v_#valid_56|]} [2019-11-22 11:06:43,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,400 INFO L343 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2019-11-22 11:06:43,400 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-22 11:06:43,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:43,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:43,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:43,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:43,466 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-22 11:06:43,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:43,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:43,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:43,469 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:43,590 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-11-22 11:06:43,591 INFO L567 ElimStorePlain]: treesize reduction 439, result has 19.2 percent of original size [2019-11-22 11:06:43,592 INFO L496 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-22 11:06:43,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:104 [2019-11-22 11:06:43,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:43,715 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-22 11:06:43,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:43,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:43,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:43,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:53 [2019-11-22 11:06:44,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:06:44,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:44,372 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-22 11:06:44,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:44,512 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-22 11:06:44,513 INFO L567 ElimStorePlain]: treesize reduction 50, result has 72.8 percent of original size [2019-11-22 11:06:44,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,523 INFO L496 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-22 11:06:44,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:107, output treesize:134 [2019-11-22 11:06:44,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:45,073 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-11-22 11:06:45,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:06:45,735 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 97 treesize of output 73 [2019-11-22 11:06:45,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:45,879 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-22 11:06:45,880 INFO L567 ElimStorePlain]: treesize reduction 28, result has 84.3 percent of original size [2019-11-22 11:06:45,886 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 51 treesize of output 39 [2019-11-22 11:06:45,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:45,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:45,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2019-11-22 11:06:45,968 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:46,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:46,022 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 68 treesize of output 56 [2019-11-22 11:06:46,022 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:46,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:46,066 INFO L496 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-22 11:06:46,066 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:208, output treesize:84 [2019-11-22 11:06:46,262 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-22 11:06:46,294 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-22 11:06:46,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:46,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 27 [2019-11-22 11:06:46,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292355387] [2019-11-22 11:06:46,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-22 11:06:46,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:46,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-22 11:06:46,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-11-22 11:06:46,297 INFO L87 Difference]: Start difference. First operand 334 states and 410 transitions. Second operand 28 states. [2019-11-22 11:06:46,581 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-22 11:06:46,851 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-11-22 11:06:47,241 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-11-22 11:06:47,668 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2019-11-22 11:06:47,936 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2019-11-22 11:06:48,191 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-11-22 11:06:48,800 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2019-11-22 11:06:49,255 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-22 11:06:49,588 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-22 11:06:50,035 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 128 [2019-11-22 11:06:50,596 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 129 [2019-11-22 11:06:51,254 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 144 [2019-11-22 11:06:52,046 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 144 [2019-11-22 11:06:52,631 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-11-22 11:06:52,989 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 138 [2019-11-22 11:06:53,683 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2019-11-22 11:06:54,214 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-22 11:06:55,062 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-22 11:06:55,300 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-11-22 11:06:55,725 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-22 11:06:55,982 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-22 11:06:56,495 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-11-22 11:06:57,087 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-11-22 11:06:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:57,522 INFO L93 Difference]: Finished difference Result 408 states and 478 transitions. [2019-11-22 11:06:57,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-22 11:06:57,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-22 11:06:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:57,526 INFO L225 Difference]: With dead ends: 408 [2019-11-22 11:06:57,526 INFO L226 Difference]: Without dead ends: 408 [2019-11-22 11:06:57,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=751, Invalid=2670, Unknown=1, NotChecked=0, Total=3422 [2019-11-22 11:06:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-22 11:06:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 333. [2019-11-22 11:06:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-22 11:06:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 406 transitions. [2019-11-22 11:06:57,537 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 406 transitions. Word has length 45 [2019-11-22 11:06:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:57,537 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 406 transitions. [2019-11-22 11:06:57,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-22 11:06:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 406 transitions. [2019-11-22 11:06:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-22 11:06:57,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:57,538 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-22 11:06:57,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:57,742 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-22 11:06:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1186742862, now seen corresponding path program 1 times [2019-11-22 11:06:57,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:57,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175010419] [2019-11-22 11:06:57,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:57,876 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-22 11:06:57,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175010419] [2019-11-22 11:06:57,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425327741] [2019-11-22 11:06:57,877 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-22 11:06:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:58,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-22 11:06:58,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:58,046 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-22 11:06:58,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:58,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 5 [2019-11-22 11:06:58,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689899484] [2019-11-22 11:06:58,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:06:58,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:06:58,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:06:58,049 INFO L87 Difference]: Start difference. First operand 333 states and 406 transitions. Second operand 6 states. [2019-11-22 11:06:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:58,311 INFO L93 Difference]: Finished difference Result 345 states and 417 transitions. [2019-11-22 11:06:58,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:06:58,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-22 11:06:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:58,316 INFO L225 Difference]: With dead ends: 345 [2019-11-22 11:06:58,316 INFO L226 Difference]: Without dead ends: 345 [2019-11-22 11:06:58,316 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-22 11:06:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-22 11:06:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 332. [2019-11-22 11:06:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-22 11:06:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 404 transitions. [2019-11-22 11:06:58,325 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 404 transitions. Word has length 50 [2019-11-22 11:06:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:58,325 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 404 transitions. [2019-11-22 11:06:58,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:06:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 404 transitions. [2019-11-22 11:06:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-22 11:06:58,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:58,327 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-22 11:06:58,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:58,531 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-22 11:06:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1865676899, now seen corresponding path program 1 times [2019-11-22 11:06:58,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:58,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043437187] [2019-11-22 11:06:58,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:58,664 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-22 11:06:58,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043437187] [2019-11-22 11:06:58,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399224907] [2019-11-22 11:06:58,665 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-22 11:06:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:58,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 11:06:58,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:58,834 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-22 11:06:58,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:58,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 5 [2019-11-22 11:06:58,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739181299] [2019-11-22 11:06:58,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:06:58,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:58,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:06:58,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:06:58,836 INFO L87 Difference]: Start difference. First operand 332 states and 404 transitions. Second operand 6 states. [2019-11-22 11:06:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:06:59,122 INFO L93 Difference]: Finished difference Result 344 states and 415 transitions. [2019-11-22 11:06:59,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:06:59,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-22 11:06:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:06:59,125 INFO L225 Difference]: With dead ends: 344 [2019-11-22 11:06:59,125 INFO L226 Difference]: Without dead ends: 344 [2019-11-22 11:06:59,125 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-22 11:06:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-22 11:06:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2019-11-22 11:06:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-22 11:06:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 402 transitions. [2019-11-22 11:06:59,134 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 402 transitions. Word has length 51 [2019-11-22 11:06:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:06:59,134 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 402 transitions. [2019-11-22 11:06:59,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:06:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 402 transitions. [2019-11-22 11:06:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-22 11:06:59,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:06:59,136 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-22 11:06:59,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:06:59,339 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-22 11:06:59,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:06:59,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2001408976, now seen corresponding path program 1 times [2019-11-22 11:06:59,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:06:59,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859741140] [2019-11-22 11:06:59,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:06:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:59,463 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-22 11:06:59,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859741140] [2019-11-22 11:06:59,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963106696] [2019-11-22 11:06:59,464 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-22 11:06:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:06:59,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-22 11:06:59,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:06:59,633 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-22 11:06:59,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:59,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:59,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:06:59,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 11:06:59,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:06:59,654 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-22 11:06:59,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:06:59,670 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-22 11:06:59,671 INFO L496 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-22 11:06:59,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-22 11:06:59,688 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-22 11:06:59,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:06:59,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-22 11:06:59,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056380989] [2019-11-22 11:06:59,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:06:59,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:06:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:06:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:06:59,689 INFO L87 Difference]: Start difference. First operand 331 states and 402 transitions. Second operand 7 states. [2019-11-22 11:07:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:00,378 INFO L93 Difference]: Finished difference Result 357 states and 421 transitions. [2019-11-22 11:07:00,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:07:00,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-22 11:07:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:00,381 INFO L225 Difference]: With dead ends: 357 [2019-11-22 11:07:00,381 INFO L226 Difference]: Without dead ends: 357 [2019-11-22 11:07:00,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:07:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-22 11:07:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 334. [2019-11-22 11:07:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-22 11:07:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 404 transitions. [2019-11-22 11:07:00,388 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 404 transitions. Word has length 52 [2019-11-22 11:07:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:00,389 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 404 transitions. [2019-11-22 11:07:00,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:07:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 404 transitions. [2019-11-22 11:07:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-22 11:07:00,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:00,390 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-22 11:07:00,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:00,594 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-22 11:07:00,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:00,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1038016890, now seen corresponding path program 1 times [2019-11-22 11:07:00,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:07:00,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662451299] [2019-11-22 11:07:00,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:07:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:00,738 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-22 11:07:00,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662451299] [2019-11-22 11:07:00,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424210241] [2019-11-22 11:07:00,739 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-22 11:07:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:00,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 11:07:00,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:01,075 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 11:07:01,075 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:07:01,076 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-22 11:07:01,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,127 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 11:07:01,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:01,129 INFO L496 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-22 11:07:01,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 11:07:01,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:01,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:01,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:01,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:01,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:01,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:01,835 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 34 treesize of output 142 [2019-11-22 11:07:01,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,837 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:01,837 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,838 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:01,838 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,839 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:01,839 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,840 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:01,840 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,841 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:01,841 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,841 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:01,842 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:01,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:01,843 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 11:07:01,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:01,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:02,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:02,111 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 34 treesize of output 142 [2019-11-22 11:07:02,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:02,113 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:02,114 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:02,114 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:02,114 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:02,115 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:02,115 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:02,116 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:02,116 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:02,117 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:02,117 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:02,118 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:02,118 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:02,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:02,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:02,120 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 11:07:02,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:02,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:02,341 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-22 11:07:02,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:07:02,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-22 11:07:02,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345223950] [2019-11-22 11:07:02,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:07:02,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:07:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:07:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:07:02,343 INFO L87 Difference]: Start difference. First operand 334 states and 404 transitions. Second operand 12 states. [2019-11-22 11:07:02,684 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-22 11:07:05,218 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-11-22 11:07:05,382 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-22 11:07:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:09,615 INFO L93 Difference]: Finished difference Result 354 states and 419 transitions. [2019-11-22 11:07:09,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:07:09,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-22 11:07:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:09,618 INFO L225 Difference]: With dead ends: 354 [2019-11-22 11:07:09,618 INFO L226 Difference]: Without dead ends: 354 [2019-11-22 11:07:09,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:07:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-22 11:07:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 334. [2019-11-22 11:07:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-22 11:07:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 401 transitions. [2019-11-22 11:07:09,626 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 401 transitions. Word has length 54 [2019-11-22 11:07:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:09,626 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 401 transitions. [2019-11-22 11:07:09,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:07:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 401 transitions. [2019-11-22 11:07:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-22 11:07:09,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:09,628 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-22 11:07:09,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:09,832 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-22 11:07:09,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:09,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2113752430, now seen corresponding path program 1 times [2019-11-22 11:07:09,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:07:09,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308902939] [2019-11-22 11:07:09,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:07:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:09,992 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-22 11:07:09,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308902939] [2019-11-22 11:07:09,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583877486] [2019-11-22 11:07:09,993 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-22 11:07:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:10,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 11:07:10,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:10,353 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:07:10,354 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:07:10,354 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-22 11:07:10,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,426 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 11:07:10,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,440 INFO L496 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-22 11:07:10,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:54 [2019-11-22 11:07:10,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:10,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,707 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-22 11:07:10,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,756 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-22 11:07:10,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,805 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-22 11:07:10,806 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,831 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-22 11:07:10,831 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,844 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 17 treesize of output 21 [2019-11-22 11:07:10,844 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,871 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,871 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-22 11:07:10,872 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,944 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-22 11:07:10,945 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,958 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 17 treesize of output 21 [2019-11-22 11:07:10,959 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,967 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:10,972 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:10,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:10,988 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-22 11:07:10,988 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:10,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:10,996 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:10,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:10,999 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,004 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 24 [2019-11-22 11:07:11,004 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,012 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,019 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-22 11:07:11,019 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,034 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 17 treesize of output 21 [2019-11-22 11:07:11,035 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,041 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,043 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,047 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,047 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,051 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,051 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 37 treesize of output 24 [2019-11-22 11:07:11,052 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,065 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 17 treesize of output 21 [2019-11-22 11:07:11,065 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,070 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,072 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,073 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,074 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,074 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 13 [2019-11-22 11:07:11,075 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,081 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,082 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,084 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 13 [2019-11-22 11:07:11,084 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,092 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,093 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 13 [2019-11-22 11:07:11,093 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,101 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,102 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 13 [2019-11-22 11:07:11,103 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,109 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,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 22 treesize of output 13 [2019-11-22 11:07:11,109 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,115 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,116 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,117 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 17 treesize of output 13 [2019-11-22 11:07:11,117 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,125 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,126 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,129 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 32 treesize of output 13 [2019-11-22 11:07:11,129 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,136 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,136 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,138 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 13 [2019-11-22 11:07:11,138 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,149 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,149 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,150 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 32 treesize of output 13 [2019-11-22 11:07:11,150 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,154 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,155 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,157 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,157 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,159 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 13 [2019-11-22 11:07:11,159 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,165 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,165 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,166 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,169 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 32 treesize of output 13 [2019-11-22 11:07:11,169 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,174 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 12 treesize of output 10 [2019-11-22 11:07:11,174 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,180 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,180 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,185 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,185 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,190 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,190 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,195 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,196 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,200 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,201 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,204 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,205 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,242 INFO L567 ElimStorePlain]: treesize reduction 147, result has 4.5 percent of original size [2019-11-22 11:07:11,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,243 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-22 11:07:11,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,351 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-22 11:07:11,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,380 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-22 11:07:11,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,393 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,393 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 17 treesize of output 21 [2019-11-22 11:07:11,394 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,407 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,408 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 17 treesize of output 21 [2019-11-22 11:07:11,408 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,418 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,428 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,429 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 24 [2019-11-22 11:07:11,429 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,437 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 13 [2019-11-22 11:07:11,437 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,465 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-22 11:07:11,465 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,483 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,483 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,489 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,489 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 24 [2019-11-22 11:07:11,490 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,500 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,505 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,505 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-22 11:07:11,505 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,519 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,528 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,529 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,530 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,543 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,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, 0 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 43 [2019-11-22 11:07:11,544 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,558 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 17 treesize of output 21 [2019-11-22 11:07:11,558 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,564 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,568 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,569 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 13 [2019-11-22 11:07:11,569 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,575 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,578 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 13 [2019-11-22 11:07:11,578 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:11,590 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 17 treesize of output 21 [2019-11-22 11:07:11,590 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,599 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-11-22 11:07:11,602 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,610 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,611 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,611 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 13 [2019-11-22 11:07:11,612 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,621 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 13 [2019-11-22 11:07:11,621 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,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, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2019-11-22 11:07:11,632 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,639 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,639 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,640 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 13 [2019-11-22 11:07:11,640 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,646 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,648 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,650 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,650 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 13 [2019-11-22 11:07:11,650 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,659 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,660 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,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, 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 13 [2019-11-22 11:07:11,660 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,668 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,670 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 13 [2019-11-22 11:07:11,670 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,675 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,678 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 13 [2019-11-22 11:07:11,679 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,684 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,685 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,685 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 17 treesize of output 13 [2019-11-22 11:07:11,686 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,693 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,694 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:07:11,695 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 13 [2019-11-22 11:07:11,695 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,700 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 12 treesize of output 10 [2019-11-22 11:07:11,700 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,706 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,706 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,711 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,712 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,716 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,717 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,721 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,722 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,726 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,726 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,729 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:11,730 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,757 INFO L567 ElimStorePlain]: treesize reduction 90, result has 7.2 percent of original size [2019-11-22 11:07:11,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:11,758 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 6 variables, input treesize:785, output treesize:7 [2019-11-22 11:07:11,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:11,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:12,011 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 17 [2019-11-22 11:07:12,048 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-22 11:07:12,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:07:12,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-11-22 11:07:12,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376716534] [2019-11-22 11:07:12,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:07:12,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:07:12,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:07:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:07:12,050 INFO L87 Difference]: Start difference. First operand 334 states and 401 transitions. Second operand 12 states. [2019-11-22 11:07:12,250 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-22 11:07:12,807 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-11-22 11:07:13,101 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-11-22 11:07:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:13,301 INFO L93 Difference]: Finished difference Result 349 states and 415 transitions. [2019-11-22 11:07:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:07:13,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-22 11:07:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:13,304 INFO L225 Difference]: With dead ends: 349 [2019-11-22 11:07:13,305 INFO L226 Difference]: Without dead ends: 349 [2019-11-22 11:07:13,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-22 11:07:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-22 11:07:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 334. [2019-11-22 11:07:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-22 11:07:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 399 transitions. [2019-11-22 11:07:13,312 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 399 transitions. Word has length 55 [2019-11-22 11:07:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:13,313 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 399 transitions. [2019-11-22 11:07:13,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:07:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 399 transitions. [2019-11-22 11:07:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-22 11:07:13,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:13,314 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-22 11:07:13,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:13,515 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-22 11:07:13,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:13,515 INFO L82 PathProgramCache]: Analyzing trace with hash -921542745, now seen corresponding path program 1 times [2019-11-22 11:07:13,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:07:13,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920135135] [2019-11-22 11:07:13,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:07:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:13,836 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-22 11:07:13,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920135135] [2019-11-22 11:07:13,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604581878] [2019-11-22 11:07:13,837 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-22 11:07:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:13,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-22 11:07:13,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:13,997 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 9=[|v_#valid_60|]} [2019-11-22 11:07:14,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,083 INFO L343 Elim1Store]: treesize reduction 142, result has 12.9 percent of original size [2019-11-22 11:07:14,083 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-22 11:07:14,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:14,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:14,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,130 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-22 11:07:14,130 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-22 11:07:14,188 INFO L567 ElimStorePlain]: treesize reduction 14, result has 81.6 percent of original size [2019-11-22 11:07:14,189 INFO L496 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-22 11:07:14,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:62 [2019-11-22 11:07:14,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:14,286 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-22 11:07:14,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:14,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:14,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:14,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-22 11:07:14,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:14,383 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-22 11:07:14,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:14,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:14,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:14,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-11-22 11:07:14,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:07:14,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:14,844 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-22 11:07:14,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:14,937 INFO L567 ElimStorePlain]: treesize reduction 34, result has 67.9 percent of original size [2019-11-22 11:07:14,950 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-22 11:07:14,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:14,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:14,986 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-22 11:07:14,986 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:15,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:15,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,020 INFO L496 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-22 11:07:15,020 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:53, output treesize:58 [2019-11-22 11:07:15,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:15,375 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-11-22 11:07:15,500 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-22 11:07:15,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:07:15,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2019-11-22 11:07:15,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430327757] [2019-11-22 11:07:15,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-22 11:07:15,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:07:15,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-22 11:07:15,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:07:15,503 INFO L87 Difference]: Start difference. First operand 334 states and 399 transitions. Second operand 21 states. [2019-11-22 11:07:15,813 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-22 11:07:16,033 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-22 11:07:16,430 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-22 11:07:16,645 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-11-22 11:07:17,080 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-11-22 11:07:17,536 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-11-22 11:07:17,791 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-22 11:07:18,280 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-11-22 11:07:18,616 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2019-11-22 11:07:18,987 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-22 11:07:19,276 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-11-22 11:07:19,677 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-22 11:07:20,117 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2019-11-22 11:07:21,186 WARN L192 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-11-22 11:07:21,652 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-22 11:07:22,282 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-11-22 11:07:23,688 WARN L192 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 151 [2019-11-22 11:07:24,934 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 171 DAG size of output: 157 [2019-11-22 11:07:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:07:26,748 INFO L93 Difference]: Finished difference Result 356 states and 416 transitions. [2019-11-22 11:07:26,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-22 11:07:26,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-11-22 11:07:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:07:26,751 INFO L225 Difference]: With dead ends: 356 [2019-11-22 11:07:26,751 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 11:07:26,752 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-22 11:07:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 11:07:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 333. [2019-11-22 11:07:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-22 11:07:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 393 transitions. [2019-11-22 11:07:26,758 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 393 transitions. Word has length 60 [2019-11-22 11:07:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:07:26,759 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 393 transitions. [2019-11-22 11:07:26,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-22 11:07:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 393 transitions. [2019-11-22 11:07:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-22 11:07:26,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:07:26,761 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-22 11:07:26,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:07:26,962 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-22 11:07:26,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:07:26,962 INFO L82 PathProgramCache]: Analyzing trace with hash 410180855, now seen corresponding path program 1 times [2019-11-22 11:07:26,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:07:26,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214627347] [2019-11-22 11:07:26,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:07:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:28,142 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-22 11:07:28,573 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38 [2019-11-22 11:07:28,592 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-22 11:07:28,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214627347] [2019-11-22 11:07:28,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577472149] [2019-11-22 11:07:28,592 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-22 11:07:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:07:28,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-22 11:07:28,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:07:28,941 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 11:07:28,942 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:07:28,942 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-22 11:07:28,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:28,993 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 11:07:28,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:28,994 INFO L496 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-22 11:07:28,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 11:07:28,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:29,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:29,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:29,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:29,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:30,050 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:07:30,050 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,051 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 39 treesize of output 193 [2019-11-22 11:07:30,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,168 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 34 treesize of output 142 [2019-11-22 11:07:30,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,175 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:30,175 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,176 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:30,176 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,177 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:30,177 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,179 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:30,179 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,180 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:07:30,181 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,186 INFO L567 ElimStorePlain]: treesize reduction 29, result has 9.4 percent of original size [2019-11-22 11:07:30,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,187 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:247, output treesize:3 [2019-11-22 11:07:30,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:07:30,358 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:07:30,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,359 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-22 11:07:30,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,534 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:07:30,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,535 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-22 11:07:30,537 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,778 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-22 11:07:30,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,779 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-22 11:07:30,781 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:30,956 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:07:30,957 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:30,957 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-22 11:07:30,959 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,137 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:07:31,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:31,138 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 39 treesize of output 193 [2019-11-22 11:07:31,140 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,312 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:07:31,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:31,313 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-22 11:07:31,314 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,458 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-22 11:07:31,459 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:31,459 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-22 11:07:31,460 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,689 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-11-22 11:07:31,689 INFO L567 ElimStorePlain]: treesize reduction 77, result has 62.1 percent of original size [2019-11-22 11:07:31,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:07:31,690 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:261, output treesize:14 [2019-11-22 11:07:31,695 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-22 11:07:31,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:07:31,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-22 11:07:31,830 INFO L343 Elim1Store]: treesize reduction 13, result has 79.4 percent of original size [2019-11-22 11:07:31,830 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-22 11:07:31,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:07:31,865 INFO L567 ElimStorePlain]: treesize reduction 23, result has 54.9 percent of original size [2019-11-22 11:07:31,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:31,866 INFO L496 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-22 11:07:31,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:28 [2019-11-22 11:07:31,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:31,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:31,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:07:32,000 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-22 11:07:32,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:07:32,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2019-11-22 11:07:32,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427373494] [2019-11-22 11:07:32,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-22 11:07:32,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:07:32,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-22 11:07:32,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-11-22 11:07:32,002 INFO L87 Difference]: Start difference. First operand 333 states and 393 transitions. Second operand 24 states. [2019-11-22 11:08:12,347 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 11:08:22,714 WARN L192 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-11-22 11:08:23,630 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-11-22 11:08:24,866 WARN L192 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-11-22 11:09:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:09:17,001 INFO L93 Difference]: Finished difference Result 354 states and 411 transitions. [2019-11-22 11:09:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-22 11:09:17,001 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-11-22 11:09:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:09:17,003 INFO L225 Difference]: With dead ends: 354 [2019-11-22 11:09:17,003 INFO L226 Difference]: Without dead ends: 354 [2019-11-22 11:09:17,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 11:09:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-22 11:09:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 332. [2019-11-22 11:09:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-22 11:09:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 392 transitions. [2019-11-22 11:09:17,011 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 392 transitions. Word has length 64 [2019-11-22 11:09:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:09:17,011 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 392 transitions. [2019-11-22 11:09:17,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-22 11:09:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 392 transitions. [2019-11-22 11:09:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-22 11:09:17,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:09:17,013 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-22 11:09:17,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:09:17,217 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-22 11:09:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:09:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1152340356, now seen corresponding path program 1 times [2019-11-22 11:09:17,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:09:17,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206264981] [2019-11-22 11:09:17,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:09:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:17,505 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-22 11:09:17,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206264981] [2019-11-22 11:09:17,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:09:17,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-22 11:09:17,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990324026] [2019-11-22 11:09:17,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 11:09:17,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:09:17,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 11:09:17,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:09:17,508 INFO L87 Difference]: Start difference. First operand 332 states and 392 transitions. Second operand 11 states. [2019-11-22 11:09:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:09:18,435 INFO L93 Difference]: Finished difference Result 369 states and 423 transitions. [2019-11-22 11:09:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:09:18,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-11-22 11:09:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:09:18,439 INFO L225 Difference]: With dead ends: 369 [2019-11-22 11:09:18,439 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 11:09:18,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-22 11:09:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 11:09:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 328. [2019-11-22 11:09:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-22 11:09:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 379 transitions. [2019-11-22 11:09:18,447 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 379 transitions. Word has length 73 [2019-11-22 11:09:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:09:18,448 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 379 transitions. [2019-11-22 11:09:18,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 11:09:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 379 transitions. [2019-11-22 11:09:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-22 11:09:18,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:09:18,450 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-22 11:09:18,450 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-22 11:09:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:09:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash -169295363, now seen corresponding path program 1 times [2019-11-22 11:09:18,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:09:18,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709298379] [2019-11-22 11:09:18,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:09:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:19,732 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-11-22 11:09:19,953 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-11-22 11:09:20,154 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-11-22 11:09:20,485 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2019-11-22 11:09:20,511 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-22 11:09:20,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709298379] [2019-11-22 11:09:20,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233406194] [2019-11-22 11:09:20,512 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-22 11:09:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:20,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-22 11:09:20,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:09:20,800 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-22 11:09:20,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:20,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:20,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:09:20,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-22 11:09:20,908 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:20,909 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-22 11:09:20,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:20,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:20,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:09:20,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-22 11:09:21,105 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-22 11:09:21,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:21,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:21,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:09:21,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2019-11-22 11:09:21,350 INFO L343 Elim1Store]: treesize reduction 25, result has 74.7 percent of original size [2019-11-22 11:09:21,351 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-22 11:09:21,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:21,395 INFO L567 ElimStorePlain]: treesize reduction 35, result has 55.1 percent of original size [2019-11-22 11:09:21,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:21,397 INFO L496 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-22 11:09:21,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:43 [2019-11-22 11:09:21,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:21,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:21,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:21,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:21,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:21,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:21,865 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-22 11:09:21,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:21,874 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-22 11:09:21,874 INFO L496 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-22 11:09:21,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2019-11-22 11:09:21,948 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-22 11:09:21,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:09:21,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 45 [2019-11-22 11:09:21,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885826201] [2019-11-22 11:09:21,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-22 11:09:21,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:09:21,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-22 11:09:21,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1841, Unknown=0, NotChecked=0, Total=2070 [2019-11-22 11:09:21,951 INFO L87 Difference]: Start difference. First operand 328 states and 379 transitions. Second operand 46 states. [2019-11-22 11:09:22,221 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-22 11:09:22,416 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-11-22 11:09:22,625 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-22 11:09:22,984 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-22 11:09:23,904 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-22 11:09:24,078 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-11-22 11:09:24,290 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-11-22 11:09:24,486 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-22 11:09:25,190 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 34 [2019-11-22 11:09:25,439 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 35 [2019-11-22 11:09:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:09:27,046 INFO L93 Difference]: Finished difference Result 355 states and 401 transitions. [2019-11-22 11:09:27,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-22 11:09:27,047 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 65 [2019-11-22 11:09:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:09:27,048 INFO L225 Difference]: With dead ends: 355 [2019-11-22 11:09:27,048 INFO L226 Difference]: Without dead ends: 355 [2019-11-22 11:09:27,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=751, Invalid=3941, Unknown=0, NotChecked=0, Total=4692 [2019-11-22 11:09:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-22 11:09:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 328. [2019-11-22 11:09:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-22 11:09:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 378 transitions. [2019-11-22 11:09:27,058 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 378 transitions. Word has length 65 [2019-11-22 11:09:27,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:09:27,059 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 378 transitions. [2019-11-22 11:09:27,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-22 11:09:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 378 transitions. [2019-11-22 11:09:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-22 11:09:27,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:09:27,060 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-22 11:09:27,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:09:27,264 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-22 11:09:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:09:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash 515916095, now seen corresponding path program 1 times [2019-11-22 11:09:27,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:09:27,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433843887] [2019-11-22 11:09:27,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:09:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:28,184 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 31 [2019-11-22 11:09:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:28,892 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 27 [2019-11-22 11:09:29,530 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 34 [2019-11-22 11:09:30,129 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 30 [2019-11-22 11:09:30,922 WARN L192 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 45 [2019-11-22 11:09:31,407 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-22 11:09:31,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433843887] [2019-11-22 11:09:31,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292011017] [2019-11-22 11:09:31,407 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-22 11:09:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:31,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-22 11:09:31,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:09:31,780 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 32 [2019-11-22 11:09:31,781 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:09:31,781 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-22 11:09:31,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:31,846 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-11-22 11:09:31,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:31,847 INFO L496 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-22 11:09:31,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:58 [2019-11-22 11:09:31,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:31,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:31,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:32,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:32,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:32,272 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:32,272 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 40 treesize of output 148 [2019-11-22 11:09:32,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:32,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:32,389 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 37 treesize of output 137 [2019-11-22 11:09:32,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,394 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:09:32,394 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,398 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:09:32,398 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,402 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:09:32,402 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,405 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:09:32,406 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,408 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:09:32,408 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,423 INFO L567 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-11-22 11:09:32,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,424 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:271, output treesize:7 [2019-11-22 11:09:32,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:32,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:32,873 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-11-22 11:09:32,873 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:32,874 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 47 treesize of output 319 [2019-11-22 11:09:32,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:32,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:33,109 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:09:33,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:33,110 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 45 treesize of output 252 [2019-11-22 11:09:33,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:33,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:33,356 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:09:33,357 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:33,358 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 45 treesize of output 252 [2019-11-22 11:09:33,359 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:33,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:33,610 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:09:33,611 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:33,611 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 42 treesize of output 249 [2019-11-22 11:09:33,613 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:33,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:33,856 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:09:33,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:33,857 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 42 treesize of output 249 [2019-11-22 11:09:33,858 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:33,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:34,109 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:09:34,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:34,111 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 42 treesize of output 249 [2019-11-22 11:09:34,112 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:34,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:34,323 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-22 11:09:34,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:34,324 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 42 treesize of output 249 [2019-11-22 11:09:34,325 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:34,723 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-11-22 11:09:34,724 INFO L567 ElimStorePlain]: treesize reduction 724, result has 26.3 percent of original size [2019-11-22 11:09:34,725 INFO L496 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-22 11:09:34,725 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:306, output treesize:89 [2019-11-22 11:09:34,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:34,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:34,862 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 32 treesize of output 64 [2019-11-22 11:09:34,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:34,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:34,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:34,931 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:34,931 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 32 treesize of output 64 [2019-11-22 11:09:34,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:34,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:34,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:09:34,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:23 [2019-11-22 11:09:35,004 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-22 11:09:35,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:35,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:09:35,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:09:35,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-22 11:09:35,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:35,349 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-22 11:09:35,350 INFO L343 Elim1Store]: treesize reduction 26, result has 82.6 percent of original size [2019-11-22 11:09:35,350 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 35 treesize of output 145 [2019-11-22 11:09:35,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:35,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:09:35,556 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-22 11:09:35,557 INFO L343 Elim1Store]: treesize reduction 26, result has 82.6 percent of original size [2019-11-22 11:09:35,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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 145 [2019-11-22 11:09:35,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:35,744 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-11-22 11:09:35,745 INFO L567 ElimStorePlain]: treesize reduction 120, result has 39.7 percent of original size [2019-11-22 11:09:35,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,747 INFO L496 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-22 11:09:35,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:79 [2019-11-22 11:09:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:09:36,031 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-22 11:09:36,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:09:36,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 32 [2019-11-22 11:09:36,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041449989] [2019-11-22 11:09:36,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-22 11:09:36,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:09:36,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-22 11:09:36,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2019-11-22 11:09:36,034 INFO L87 Difference]: Start difference. First operand 328 states and 378 transitions. Second operand 33 states. [2019-11-22 11:09:36,256 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-11-22 11:09:36,639 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2019-11-22 11:09:37,007 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2019-11-22 11:09:38,545 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-11-22 11:09:38,931 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-11-22 11:09:39,416 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-11-22 11:09:39,720 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-22 11:09:40,106 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-11-22 11:09:40,380 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-11-22 11:09:40,643 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-11-22 11:09:41,364 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-11-22 11:09:41,644 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-11-22 11:09:42,139 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-11-22 11:09:42,405 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-11-22 11:09:43,167 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-11-22 11:09:43,642 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-22 11:09:44,137 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-22 11:09:44,444 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-11-22 11:09:44,894 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-22 11:09:45,218 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2019-11-22 11:09:45,549 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 110 [2019-11-22 11:09:46,001 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 111 [2019-11-22 11:09:46,314 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-11-22 11:09:46,669 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-11-22 11:09:46,958 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-11-22 11:09:47,390 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-11-22 11:09:47,693 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-11-22 11:09:49,190 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-11-22 11:09:49,673 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-11-22 11:09:51,528 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-11-22 11:09:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:09:52,388 INFO L93 Difference]: Finished difference Result 357 states and 402 transitions. [2019-11-22 11:09:52,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-22 11:09:52,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-11-22 11:09:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:09:52,391 INFO L225 Difference]: With dead ends: 357 [2019-11-22 11:09:52,392 INFO L226 Difference]: Without dead ends: 357 [2019-11-22 11:09:52,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=827, Invalid=4575, Unknown=0, NotChecked=0, Total=5402 [2019-11-22 11:09:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-22 11:09:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 332. [2019-11-22 11:09:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-22 11:09:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 382 transitions. [2019-11-22 11:09:52,401 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 382 transitions. Word has length 67 [2019-11-22 11:09:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:09:52,402 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 382 transitions. [2019-11-22 11:09:52,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-22 11:09:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 382 transitions. [2019-11-22 11:09:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-22 11:09:52,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:09:52,404 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-22 11:09:52,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:09:52,608 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-22 11:09:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:09:52,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1478886374, now seen corresponding path program 1 times [2019-11-22 11:09:52,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:09:52,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121355882] [2019-11-22 11:09:52,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:09:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-22 11:09:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-22 11:09:52,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-22 11:09:52,714 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-22 11:09:52,752 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-22 11:09:52,769 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-22 11:09:52,770 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-22 11:09:52,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:09:52 BoogieIcfgContainer [2019-11-22 11:09:52,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:09:52,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:09:52,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:09:52,844 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:09:52,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:01:36" (3/4) ... [2019-11-22 11:09:52,850 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-22 11:09:52,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:09:52,852 INFO L168 Benchmark]: Toolchain (without parser) took 498230.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 126.6 MB. Max. memory is 11.5 GB. [2019-11-22 11:09:52,852 INFO L168 Benchmark]: CDTParser took 0.19 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-22 11:09:52,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-22 11:09:52,854 INFO L168 Benchmark]: Boogie Preprocessor took 74.34 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-22 11:09:52,854 INFO L168 Benchmark]: RCFGBuilder took 773.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:09:52,854 INFO L168 Benchmark]: TraceAbstraction took 496659.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -60.3 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2019-11-22 11:09:52,854 INFO L168 Benchmark]: Witness Printer took 8.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:09:52,855 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.19 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 708.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.34 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 773.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 496659.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -60.3 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. * Witness Printer took 8.35 ms. Allocated memory is still 1.3 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: 496.6s, OverallIterations: 32, TraceHistogramMax: 5, AutomataDifference: 420.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1565 SDtfs, 10669 SDslu, 2860 SDs, 0 SdLazy, 15851 SolverSat, 4086 SolverUnsat, 88 SolverUnknown, 0 SolverNotchecked, 200.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1497 GetRequests, 790 SyntacticMatches, 83 SemanticMatches, 624 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6491 ImplicationChecksByTransitivity, 137.7s 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.3s SatisfiabilityAnalysisTime, 67.4s 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-5a07968 [2019-11-22 11:09:54,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:09:54,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:09:54,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:09:54,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:09:54,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:09:54,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:09:54,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:09:54,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:09:54,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:09:54,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:09:54,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:09:54,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:09:54,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:09:54,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:09:54,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:09:54,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:09:54,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:09:54,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:09:54,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:09:54,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:09:54,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:09:54,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:09:54,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:09:54,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:09:54,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:09:54,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:09:54,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:09:54,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:09:54,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:09:54,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:09:54,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:09:54,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:09:54,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:09:54,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:09:54,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:09:54,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:09:54,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:09:54,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:09:54,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:09:54,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:09:54,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 11:09:54,980 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:09:54,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:09:54,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:09:54,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:09:54,982 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:09:54,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:09:54,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:09:54,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:09:54,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:09:54,984 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:09:54,984 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:09:54,984 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 11:09:54,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:09:54,985 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:09:54,985 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 11:09:54,985 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 11:09:54,986 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:09:54,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:09:54,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:09:54,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:09:54,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:09:54,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:09:54,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:09:54,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:09:54,988 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 11:09:54,988 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 11:09:54,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 11:09:54,989 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-22 11:09:55,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:09:55,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:09:55,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:09:55,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:09:55,304 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:09:55,305 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-22 11:09:55,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cc73677/8ca7877e9c7f4e64ad6638af7d5fde24/FLAGdc1453f4c [2019-11-22 11:09:55,948 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:09:55,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2019-11-22 11:09:55,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cc73677/8ca7877e9c7f4e64ad6638af7d5fde24/FLAGdc1453f4c [2019-11-22 11:09:56,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cc73677/8ca7877e9c7f4e64ad6638af7d5fde24 [2019-11-22 11:09:56,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:09:56,221 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:09:56,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:09:56,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:09:56,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:09:56,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:56,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f25c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56, skipping insertion in model container [2019-11-22 11:09:56,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:56,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:09:56,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:09:56,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:09:56,750 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:09:56,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:09:56,924 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:09:56,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56 WrapperNode [2019-11-22 11:09:56,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:09:56,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:09:56,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:09:56,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:09:56,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:56,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:56,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:56,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:56,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:57,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:57,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56" (1/1) ... [2019-11-22 11:09:57,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:09:57,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:09:57,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:09:57,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:09:57,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09: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-22 11:09:57,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:09:57,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:09:57,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-11-22 11:09:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 11:09:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 11:09:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 11:09:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2019-11-22 11:09:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure c1 [2019-11-22 11:09:57,100 INFO L138 BoogieDeclarations]: Found implementation of procedure c2 [2019-11-22 11:09:57,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:09:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 11:09:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 11:09:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 11:09:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 11:09:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 11:09:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 11:09:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 11:09:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 11:09:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 11:09:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 11:09:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 11:09:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 11:09:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 11:09:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 11:09:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 11:09:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 11:09:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 11:09:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 11:09:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 11:09:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 11:09:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 11:09:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 11:09:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 11:09:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 11:09:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 11:09:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 11:09:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 11:09:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 11:09:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 11:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 11:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 11:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 11:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 11:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 11:09:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 11:09:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 11:09:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 11:09:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 11:09:57,112 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 11:09:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 11:09:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 11:09:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 11:09:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 11:09:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 11:09:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 11:09:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 11:09:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 11:09:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 11:09:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 11:09:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 11:09:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 11:09:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 11:09:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 11:09:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:09:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 11:09:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:09:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 11:09:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 11:09:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 11:09:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 11:09:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 11:09:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 11:09:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 11:09:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 11:09:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 11:09:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 11:09:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 11:09:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 11:09:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 11:09:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 11:09:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 11:09:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 11:09:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 11:09:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 11:09:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 11:09:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 11:09:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 11:09:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 11:09:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 11:09:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 11:09:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-22 11:09:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-22 11:09:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-22 11:09:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-22 11:09:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-22 11:09:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-22 11:09:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-22 11:09:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-22 11:09:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-22 11:09:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-22 11:09:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-22 11:09:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-22 11:09:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-22 11:09:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-22 11:09:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-22 11:09:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-22 11:09:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-22 11:09:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-22 11:09:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-22 11:09:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-22 11:09:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-22 11:09:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-22 11:09:57,130 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-22 11:09:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-22 11:09:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-22 11:09:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-22 11:09:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-22 11:09:57,131 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-22 11:09:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-22 11:09:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-22 11:09:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-22 11:09:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-22 11:09:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure __bzero [2019-11-22 11:09:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-22 11:09:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-22 11:09:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-22 11:09:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-22 11:09:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-22 11:09:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-22 11:09:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-22 11:09:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-22 11:09:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-22 11:09:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-22 11:09:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-22 11:09:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-22 11:09:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-22 11:09:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-22 11:09:57,135 INFO L130 BoogieDeclarations]: Found specification of procedure c1 [2019-11-22 11:09:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure c2 [2019-11-22 11:09:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 11:09:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2019-11-22 11:09:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-11-22 11:09:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 11:09:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-22 11:09:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:09:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:09:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:09:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:09:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-22 11:09:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 11:09:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:09:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 11:09:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 11:09:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-22 11:09:57,911 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:09:57,911 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-22 11:09:57,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:09:57 BoogieIcfgContainer [2019-11-22 11:09:57,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:09:57,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:09:57,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:09:57,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:09:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:09:56" (1/3) ... [2019-11-22 11:09:57,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9d305c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:09:57, skipping insertion in model container [2019-11-22 11:09:57,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:56" (2/3) ... [2019-11-22 11:09:57,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9d305c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:09:57, skipping insertion in model container [2019-11-22 11:09:57,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:09:57" (3/3) ... [2019-11-22 11:09:57,922 INFO L109 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2019-11-22 11:09:57,931 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:09:57,939 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 11:09:57,950 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 11:09:57,965 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:09:57,966 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:09:57,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:09:57,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:09:57,966 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:09:57,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:09:57,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:09:57,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:09:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-22 11:09:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:09:57,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:09:57,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:09:57,992 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-22 11:09:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:09:57,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100954, now seen corresponding path program 1 times [2019-11-22 11:09:58,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:09:58,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [216182533] [2019-11-22 11:09:58,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:09:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:58,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 11:09:58,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:09:58,832 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 11:09:58,834 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:09:58,835 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-22 11:09:58,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:09:58,942 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-22 11:09:58,943 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-22 11:09:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:58,955 INFO L496 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-22 11:09:58,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:24, output treesize:55 [2019-11-22 11:09:58,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:09:58,999 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-22 11:09:58,999 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:09:59,038 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-22 11:09:59,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [216182533] [2019-11-22 11:09:59,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:09:59,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 11:09:59,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733344014] [2019-11-22 11:09:59,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:09:59,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:09:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:09:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:09:59,066 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-22 11:09:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:09:59,244 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2019-11-22 11:09:59,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:09:59,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-22 11:09:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:09:59,262 INFO L225 Difference]: With dead ends: 93 [2019-11-22 11:09:59,262 INFO L226 Difference]: Without dead ends: 87 [2019-11-22 11:09:59,265 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-22 11:09:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-22 11:09:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-22 11:09:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-22 11:09:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-11-22 11:09:59,327 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 9 [2019-11-22 11:09:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:09:59,328 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-11-22 11:09:59,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:09:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-11-22 11:09:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 11:09:59,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:09:59,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:09:59,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:09:59,535 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-22 11:09:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:09:59,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1137100953, now seen corresponding path program 1 times [2019-11-22 11:09:59,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:09:59,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [886076655] [2019-11-22 11:09:59,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:09:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:09:59,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 11:09:59,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:00,271 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:10:00,272 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:10:00,273 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-22 11:10:00,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:00,429 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-22 11:10:00,433 INFO L567 ElimStorePlain]: treesize reduction 50, result has 51.9 percent of original size [2019-11-22 11:10:00,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:10:00,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:25, output treesize:9 [2019-11-22 11:10:00,463 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-22 11:10:00,463 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:00,685 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-22 11:10:00,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [886076655] [2019-11-22 11:10:00,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:00,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 11:10:00,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784278111] [2019-11-22 11:10:00,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:10:00,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:10:00,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:10:00,712 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 6 states. [2019-11-22 11:10:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:01,301 INFO L93 Difference]: Finished difference Result 172 states and 231 transitions. [2019-11-22 11:10:01,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:10:01,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-22 11:10:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:01,305 INFO L225 Difference]: With dead ends: 172 [2019-11-22 11:10:01,305 INFO L226 Difference]: Without dead ends: 172 [2019-11-22 11:10:01,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:10:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-22 11:10:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2019-11-22 11:10:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-22 11:10:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-11-22 11:10:01,335 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 9 [2019-11-22 11:10:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:01,336 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-11-22 11:10:01,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:10:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-11-22 11:10:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 11:10:01,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:01,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:10:01,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:01,541 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-22 11:10:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash -890391164, now seen corresponding path program 1 times [2019-11-22 11:10:01,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:01,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [843807369] [2019-11-22 11:10:01,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:01,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 11:10:01,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:02,476 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2019-11-22 11:10:02,478 INFO L343 Elim1Store]: treesize reduction 591, result has 19.8 percent of original size [2019-11-22 11:10:02,479 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 15 case distinctions, treesize of input 325 treesize of output 419 [2019-11-22 11:10:02,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:02,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:03,526 WARN L192 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-22 11:10:03,529 INFO L567 ElimStorePlain]: treesize reduction 6909, result has 2.3 percent of original size [2019-11-22 11:10:03,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:03,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:10:03,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:146, output treesize:166 [2019-11-22 11:10:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:03,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:03,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:03,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:03,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:03,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:04,079 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-11-22 11:10:04,124 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 88 treesize of output 44 [2019-11-22 11:10:04,126 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:10:04,253 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-11-22 11:10:04,254 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.3 percent of original size [2019-11-22 11:10:04,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 11:10:04,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:124, output treesize:70 [2019-11-22 11:10:04,294 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-22 11:10:04,294 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:04,663 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-22 11:10:04,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [843807369] [2019-11-22 11:10:04,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:04,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 11:10:04,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653353728] [2019-11-22 11:10:04,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:10:04,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:04,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:10:04,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:10:04,666 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 8 states. [2019-11-22 11:10:04,914 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-11-22 11:10:05,224 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-22 11:10:05,530 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-11-22 11:10:06,181 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-11-22 11:10:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:06,876 INFO L93 Difference]: Finished difference Result 292 states and 423 transitions. [2019-11-22 11:10:06,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-22 11:10:06,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-22 11:10:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:06,881 INFO L225 Difference]: With dead ends: 292 [2019-11-22 11:10:06,882 INFO L226 Difference]: Without dead ends: 292 [2019-11-22 11:10:06,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:10:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-22 11:10:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 226. [2019-11-22 11:10:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-22 11:10:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 339 transitions. [2019-11-22 11:10:06,917 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 339 transitions. Word has length 10 [2019-11-22 11:10:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:06,917 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 339 transitions. [2019-11-22 11:10:06,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:10:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 339 transitions. [2019-11-22 11:10:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 11:10:06,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:06,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:10:07,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:07,123 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-22 11:10:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:07,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1832322202, now seen corresponding path program 1 times [2019-11-22 11:10:07,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:07,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [503197827] [2019-11-22 11:10:07,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:07,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-22 11:10:07,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:07,550 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 12=[|v_#valid_69|]} [2019-11-22 11:10:07,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:07,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:07,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:07,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:07,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:07,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:07,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:07,979 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-22 11:10:07,981 INFO L343 Elim1Store]: treesize reduction 72, result has 65.4 percent of original size [2019-11-22 11:10:07,981 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 31 treesize of output 141 [2019-11-22 11:10:07,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:08,233 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-22 11:10:08,234 INFO L567 ElimStorePlain]: treesize reduction 70, result has 71.2 percent of original size [2019-11-22 11:10:08,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:08,332 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 266 treesize of output 288 [2019-11-22 11:10:08,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:08,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,085 WARN L192 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 68 [2019-11-22 11:10:09,086 INFO L567 ElimStorePlain]: treesize reduction 2940, result has 5.0 percent of original size [2019-11-22 11:10:09,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,090 INFO L496 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-22 11:10:09,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:134, output treesize:155 [2019-11-22 11:10:09,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:09,274 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:10:09,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:09,304 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 131 treesize of output 119 [2019-11-22 11:10:09,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:09,347 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 128 treesize of output 128 [2019-11-22 11:10:09,348 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-22 11:10:09,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2019-11-22 11:10:09,372 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:09,397 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 130 treesize of output 118 [2019-11-22 11:10:09,398 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:09,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 128 [2019-11-22 11:10:09,430 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,439 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:10:09,439 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,467 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 123 treesize of output 111 [2019-11-22 11:10:09,468 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,477 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:10:09,478 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,499 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 123 treesize of output 111 [2019-11-22 11:10:09,499 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:09,534 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 131 treesize of output 131 [2019-11-22 11:10:09,535 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:09,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:09,553 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 126 treesize of output 114 [2019-11-22 11:10:09,554 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:10,188 WARN L192 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-22 11:10:10,189 INFO L567 ElimStorePlain]: treesize reduction 698, result has 31.2 percent of original size [2019-11-22 11:10:10,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-22 11:10:10,192 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:1531, output treesize:316 [2019-11-22 11:10:10,473 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-22 11:10:10,807 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-22 11:10:10,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:10:10,849 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 81 treesize of output 61 [2019-11-22 11:10:10,850 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:10:11,048 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-22 11:10:11,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:11,083 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 58 treesize of output 50 [2019-11-22 11:10:11,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:11,288 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-22 11:10:11,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:11,321 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 81 treesize of output 73 [2019-11-22 11:10:11,322 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:11,508 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-22 11:10:11,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:11,520 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 86 treesize of output 58 [2019-11-22 11:10:11,521 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:10:11,691 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 11:10:11,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:11,710 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 53 treesize of output 45 [2019-11-22 11:10:11,711 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:11,838 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-22 11:10:11,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:11,851 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 70 treesize of output 50 [2019-11-22 11:10:11,852 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:11,985 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-22 11:10:11,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:11,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-22 11:10:11,988 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:249, output treesize:129 [2019-11-22 11:10:12,105 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-22 11:10:12,105 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:12,390 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 11:10:12,508 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 11:10:12,659 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 11:10:12,762 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-22 11:10:12,795 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-22 11:10:12,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [503197827] [2019-11-22 11:10:12,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:12,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-22 11:10:12,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086622594] [2019-11-22 11:10:12,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:10:12,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:10:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:10:12,797 INFO L87 Difference]: Start difference. First operand 226 states and 339 transitions. Second operand 9 states. [2019-11-22 11:10:13,140 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-11-22 11:10:13,546 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 91 [2019-11-22 11:10:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:15,003 INFO L93 Difference]: Finished difference Result 412 states and 600 transitions. [2019-11-22 11:10:15,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:10:15,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-11-22 11:10:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:15,013 INFO L225 Difference]: With dead ends: 412 [2019-11-22 11:10:15,015 INFO L226 Difference]: Without dead ends: 412 [2019-11-22 11:10:15,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-22 11:10:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-22 11:10:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 343. [2019-11-22 11:10:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-22 11:10:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 545 transitions. [2019-11-22 11:10:15,063 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 545 transitions. Word has length 11 [2019-11-22 11:10:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:15,063 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 545 transitions. [2019-11-22 11:10:15,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:10:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 545 transitions. [2019-11-22 11:10:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 11:10:15,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:15,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:10:15,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:15,271 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-22 11:10:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash -967413306, now seen corresponding path program 1 times [2019-11-22 11:10:15,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:15,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1899622375] [2019-11-22 11:10:15,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:15,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:10:15,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:16,010 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2019-11-22 11:10:16,011 INFO L343 Elim1Store]: treesize reduction 355, result has 19.1 percent of original size [2019-11-22 11:10:16,012 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 1568 treesize of output 1562 [2019-11-22 11:10:16,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:16,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:17,318 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 229 DAG size of output: 64 [2019-11-22 11:10:17,319 INFO L567 ElimStorePlain]: treesize reduction 58523, result has 0.2 percent of original size [2019-11-22 11:10:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:17,323 INFO L496 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-22 11:10:17,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:85, output treesize:103 [2019-11-22 11:10:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:17,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:17,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:17,881 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-22 11:10:18,054 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-22 11:10:18,055 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:18,351 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-22 11:10:18,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1899622375] [2019-11-22 11:10:18,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:18,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 11:10:18,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499861492] [2019-11-22 11:10:18,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:10:18,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:10:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:10:18,354 INFO L87 Difference]: Start difference. First operand 343 states and 545 transitions. Second operand 10 states. [2019-11-22 11:10:19,457 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-11-22 11:10:20,613 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-22 11:10:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:21,710 INFO L93 Difference]: Finished difference Result 433 states and 653 transitions. [2019-11-22 11:10:21,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:10:21,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-22 11:10:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:21,715 INFO L225 Difference]: With dead ends: 433 [2019-11-22 11:10:21,716 INFO L226 Difference]: Without dead ends: 433 [2019-11-22 11:10:21,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:10:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-22 11:10:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 381. [2019-11-22 11:10:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-22 11:10:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 599 transitions. [2019-11-22 11:10:21,745 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 599 transitions. Word has length 12 [2019-11-22 11:10:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:21,746 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 599 transitions. [2019-11-22 11:10:21,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:10:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 599 transitions. [2019-11-22 11:10:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 11:10:21,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:21,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:10:21,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:21,953 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-22 11:10:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash 74958696, now seen corresponding path program 1 times [2019-11-22 11:10:21,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:21,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [698990944] [2019-11-22 11:10:21,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:22,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 11:10:22,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:22,382 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 18=[|v_#valid_85|]} [2019-11-22 11:10:22,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,457 INFO L343 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2019-11-22 11:10:22,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 31 [2019-11-22 11:10:22,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:22,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:22,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:22,567 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:22,567 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 158 treesize of output 158 [2019-11-22 11:10:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:22,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:22,824 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-22 11:10:22,825 INFO L567 ElimStorePlain]: treesize reduction 166, result has 27.2 percent of original size [2019-11-22 11:10:22,826 INFO L496 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-22 11:10:22,826 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:85, output treesize:62 [2019-11-22 11:10:23,043 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-22 11:10:23,043 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:23,333 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-22 11:10:23,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [698990944] [2019-11-22 11:10:23,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:23,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 11:10:23,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562516524] [2019-11-22 11:10:23,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:10:23,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:23,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:10:23,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:10:23,334 INFO L87 Difference]: Start difference. First operand 381 states and 599 transitions. Second operand 8 states. [2019-11-22 11:10:27,289 WARN L192 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-22 11:10:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:28,492 INFO L93 Difference]: Finished difference Result 441 states and 624 transitions. [2019-11-22 11:10:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:10:28,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-22 11:10:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:28,497 INFO L225 Difference]: With dead ends: 441 [2019-11-22 11:10:28,497 INFO L226 Difference]: Without dead ends: 441 [2019-11-22 11:10:28,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:10:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-22 11:10:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 383. [2019-11-22 11:10:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-22 11:10:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 595 transitions. [2019-11-22 11:10:28,520 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 595 transitions. Word has length 13 [2019-11-22 11:10:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:28,521 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 595 transitions. [2019-11-22 11:10:28,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:10:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 595 transitions. [2019-11-22 11:10:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 11:10:28,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:28,522 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:10:28,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:28,727 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-22 11:10:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash -456233619, now seen corresponding path program 1 times [2019-11-22 11:10:28,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:28,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [68303828] [2019-11-22 11:10:28,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:29,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 11:10:29,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:29,264 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_73|], 15=[|v_#valid_93|]} [2019-11-22 11:10:29,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:29,555 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-22 11:10:29,556 INFO L343 Elim1Store]: treesize reduction 28, result has 81.1 percent of original size [2019-11-22 11:10:29,556 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 5 case distinctions, treesize of input 27 treesize of output 125 [2019-11-22 11:10:29,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:29,760 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-22 11:10:29,761 INFO L567 ElimStorePlain]: treesize reduction 62, result has 69.9 percent of original size [2019-11-22 11:10:29,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:29,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 402 [2019-11-22 11:10:29,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:29,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:31,149 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 248 DAG size of output: 64 [2019-11-22 11:10:31,150 INFO L567 ElimStorePlain]: treesize reduction 7690, result has 1.6 percent of original size [2019-11-22 11:10:31,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,157 INFO L496 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-22 11:10:31,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:109, output treesize:129 [2019-11-22 11:10:31,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:31,870 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-22 11:10:32,323 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-22 11:10:32,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:32,379 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 95 treesize of output 87 [2019-11-22 11:10:32,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:32,664 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-11-22 11:10:32,665 INFO L567 ElimStorePlain]: treesize reduction 48, result has 73.9 percent of original size [2019-11-22 11:10:32,676 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 72 treesize of output 56 [2019-11-22 11:10:32,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:32,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:32,782 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 63 treesize of output 55 [2019-11-22 11:10:32,783 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:32,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:32,869 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 52 treesize of output 44 [2019-11-22 11:10:32,870 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:32,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:32,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-22 11:10:32,951 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:195, output treesize:92 [2019-11-22 11:10:33,023 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-22 11:10:33,023 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:33,456 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-22 11:10:33,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [68303828] [2019-11-22 11:10:33,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:10:33,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-22 11:10:33,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033993826] [2019-11-22 11:10:33,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 11:10:33,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 11:10:33,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:10:33,458 INFO L87 Difference]: Start difference. First operand 383 states and 595 transitions. Second operand 10 states. [2019-11-22 11:10:33,749 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-22 11:10:34,653 WARN L192 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-11-22 11:10:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:36,925 INFO L93 Difference]: Finished difference Result 520 states and 767 transitions. [2019-11-22 11:10:36,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 11:10:36,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 11:10:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:36,931 INFO L225 Difference]: With dead ends: 520 [2019-11-22 11:10:36,931 INFO L226 Difference]: Without dead ends: 520 [2019-11-22 11:10:36,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:10:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-11-22 11:10:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 421. [2019-11-22 11:10:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-22 11:10:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 658 transitions. [2019-11-22 11:10:36,952 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 658 transitions. Word has length 19 [2019-11-22 11:10:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:36,953 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 658 transitions. [2019-11-22 11:10:36,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 11:10:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 658 transitions. [2019-11-22 11:10:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 11:10:36,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:36,954 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-22 11:10:37,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:37,159 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-22 11:10:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1646608229, now seen corresponding path program 1 times [2019-11-22 11:10:37,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:37,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [749742648] [2019-11-22 11:10:37,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:37,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 11:10:37,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:37,417 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-22 11:10:37,417 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:37,427 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-22 11:10:37,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [749742648] [2019-11-22 11:10:37,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:37,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 11:10:37,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474621839] [2019-11-22 11:10:37,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:10:37,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:37,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:10:37,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:10:37,429 INFO L87 Difference]: Start difference. First operand 421 states and 658 transitions. Second operand 3 states. [2019-11-22 11:10:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:37,438 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2019-11-22 11:10:37,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:10:37,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-22 11:10:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:37,442 INFO L225 Difference]: With dead ends: 322 [2019-11-22 11:10:37,443 INFO L226 Difference]: Without dead ends: 322 [2019-11-22 11:10:37,443 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-22 11:10:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-22 11:10:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2019-11-22 11:10:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-22 11:10:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 464 transitions. [2019-11-22 11:10:37,460 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 464 transitions. Word has length 23 [2019-11-22 11:10:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:37,461 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 464 transitions. [2019-11-22 11:10:37,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:10:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 464 transitions. [2019-11-22 11:10:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 11:10:37,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:37,463 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-22 11:10:37,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:37,665 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-22 11:10:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash -407602741, now seen corresponding path program 1 times [2019-11-22 11:10:37,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:37,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [209794602] [2019-11-22 11:10:37,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:37,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 11:10:37,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:37,943 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-22 11:10:37,943 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:37,973 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-22 11:10:37,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [209794602] [2019-11-22 11:10:37,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:37,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 11:10:37,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344679808] [2019-11-22 11:10:37,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:10:37,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:10:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:10:37,975 INFO L87 Difference]: Start difference. First operand 317 states and 464 transitions. Second operand 3 states. [2019-11-22 11:10:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:38,001 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2019-11-22 11:10:38,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:10:38,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-22 11:10:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:38,006 INFO L225 Difference]: With dead ends: 421 [2019-11-22 11:10:38,006 INFO L226 Difference]: Without dead ends: 421 [2019-11-22 11:10:38,006 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-22 11:10:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-22 11:10:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2019-11-22 11:10:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-22 11:10:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 619 transitions. [2019-11-22 11:10:38,027 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 619 transitions. Word has length 24 [2019-11-22 11:10:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:38,030 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 619 transitions. [2019-11-22 11:10:38,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:10:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 619 transitions. [2019-11-22 11:10:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:10:38,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:38,035 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-22 11:10:38,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:38,239 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-22 11:10:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash 249216982, now seen corresponding path program 1 times [2019-11-22 11:10:38,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:38,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1768769047] [2019-11-22 11:10:38,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:38,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 11:10:38,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:38,518 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-22 11:10:38,519 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:38,533 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-22 11:10:38,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1768769047] [2019-11-22 11:10:38,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:38,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 11:10:38,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208600628] [2019-11-22 11:10:38,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 11:10:38,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:38,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 11:10:38,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 11:10:38,535 INFO L87 Difference]: Start difference. First operand 411 states and 619 transitions. Second operand 4 states. [2019-11-22 11:10:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:38,584 INFO L93 Difference]: Finished difference Result 358 states and 502 transitions. [2019-11-22 11:10:38,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:10:38,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-22 11:10:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:38,588 INFO L225 Difference]: With dead ends: 358 [2019-11-22 11:10:38,589 INFO L226 Difference]: Without dead ends: 356 [2019-11-22 11:10:38,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-22 11:10:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-22 11:10:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 342. [2019-11-22 11:10:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-22 11:10:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 491 transitions. [2019-11-22 11:10:38,600 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 491 transitions. Word has length 25 [2019-11-22 11:10:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:38,601 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 491 transitions. [2019-11-22 11:10:38,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 11:10:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 491 transitions. [2019-11-22 11:10:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-22 11:10:38,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:38,603 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:10:38,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:38,807 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-22 11:10:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash -567996427, now seen corresponding path program 1 times [2019-11-22 11:10:38,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:38,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1710091290] [2019-11-22 11:10:38,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:39,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 11:10:39,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:39,187 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-22 11:10:39,187 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:39,230 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-22 11:10:39,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1710091290] [2019-11-22 11:10:39,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:10:39,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-22 11:10:39,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032651205] [2019-11-22 11:10:39,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:10:39,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:39,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:10:39,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:10:39,233 INFO L87 Difference]: Start difference. First operand 342 states and 491 transitions. Second operand 8 states. [2019-11-22 11:10:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:39,422 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2019-11-22 11:10:39,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:10:39,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-22 11:10:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:39,426 INFO L225 Difference]: With dead ends: 365 [2019-11-22 11:10:39,426 INFO L226 Difference]: Without dead ends: 365 [2019-11-22 11:10:39,427 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-22 11:10:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-22 11:10:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2019-11-22 11:10:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-22 11:10:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 421 transitions. [2019-11-22 11:10:39,445 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 421 transitions. Word has length 25 [2019-11-22 11:10:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:39,447 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 421 transitions. [2019-11-22 11:10:39,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:10:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 421 transitions. [2019-11-22 11:10:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:10:39,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:39,451 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-22 11:10:39,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:39,656 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-22 11:10:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2031405767, now seen corresponding path program 1 times [2019-11-22 11:10:39,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:39,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1164951600] [2019-11-22 11:10:39,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:39,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-22 11:10:39,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:39,922 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-22 11:10:39,922 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:39,978 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-22 11:10:39,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1164951600] [2019-11-22 11:10:39,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:10:39,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-22 11:10:39,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941063794] [2019-11-22 11:10:39,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 11:10:39,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:39,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 11:10:39,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 11:10:39,980 INFO L87 Difference]: Start difference. First operand 315 states and 421 transitions. Second operand 3 states. [2019-11-22 11:10:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:39,985 INFO L93 Difference]: Finished difference Result 229 states and 292 transitions. [2019-11-22 11:10:39,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 11:10:39,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-22 11:10:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:39,987 INFO L225 Difference]: With dead ends: 229 [2019-11-22 11:10:39,988 INFO L226 Difference]: Without dead ends: 229 [2019-11-22 11:10:39,988 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-22 11:10:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-22 11:10:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-11-22 11:10:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-22 11:10:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2019-11-22 11:10:39,995 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 33 [2019-11-22 11:10:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:39,995 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2019-11-22 11:10:39,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 11:10:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2019-11-22 11:10:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:10:39,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:39,997 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-22 11:10:40,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:40,202 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-22 11:10:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash -245427548, now seen corresponding path program 1 times [2019-11-22 11:10:40,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:40,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [877229794] [2019-11-22 11:10:40,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:40,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 11:10:40,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:41,154 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 33 [2019-11-22 11:10:41,155 INFO L343 Elim1Store]: treesize reduction 355, result has 14.5 percent of original size [2019-11-22 11:10:41,155 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 7 case distinctions, treesize of input 72 treesize of output 110 [2019-11-22 11:10:41,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:41,288 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-22 11:10:41,288 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.4 percent of original size [2019-11-22 11:10:41,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:41,290 INFO L496 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-22 11:10:41,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:71 [2019-11-22 11:10:41,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:41,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:41,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:41,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:41,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:41,765 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:41,765 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 60 treesize of output 136 [2019-11-22 11:10:41,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:41,949 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 11:10:41,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:41,950 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 58 treesize of output 134 [2019-11-22 11:10:41,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:42,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:42,111 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 60 treesize of output 136 [2019-11-22 11:10:42,112 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:42,127 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:10:42,128 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:42,133 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:10:42,133 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:42,139 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-22 11:10:42,139 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:42,311 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-22 11:10:42,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:42,312 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 58 treesize of output 134 [2019-11-22 11:10:42,313 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:42,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:42,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-22 11:10:42,389 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:422, output treesize:12 [2019-11-22 11:10:42,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-22 11:10:42,573 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-11-22 11:10:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 11:10:42,644 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-22 11:10:42,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [877229794] [2019-11-22 11:10:42,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:10:42,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-22 11:10:42,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447430295] [2019-11-22 11:10:42,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-22 11:10:42,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 11:10:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-22 11:10:42,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:10:42,912 INFO L87 Difference]: Start difference. First operand 229 states and 292 transitions. Second operand 14 states. [2019-11-22 11:10:43,735 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 11:10:47,536 WARN L192 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-22 11:10:52,260 WARN L192 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-22 11:10:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:10:54,058 INFO L93 Difference]: Finished difference Result 323 states and 385 transitions. [2019-11-22 11:10:54,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 11:10:54,059 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-11-22 11:10:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:10:54,061 INFO L225 Difference]: With dead ends: 323 [2019-11-22 11:10:54,061 INFO L226 Difference]: Without dead ends: 317 [2019-11-22 11:10:54,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-22 11:10:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-22 11:10:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2019-11-22 11:10:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-22 11:10:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 358 transitions. [2019-11-22 11:10:54,074 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 358 transitions. Word has length 33 [2019-11-22 11:10:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:10:54,074 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 358 transitions. [2019-11-22 11:10:54,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-22 11:10:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2019-11-22 11:10:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-22 11:10:54,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:10:54,076 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-22 11:10:54,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:54,281 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-22 11:10:54,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:10:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash -330240892, now seen corresponding path program 1 times [2019-11-22 11:10:54,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 11:10:54,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [106080771] [2019-11-22 11:10:54,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:10:54,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-22 11:10:54,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:10:55,280 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-22 11:10:55,281 INFO L343 Elim1Store]: treesize reduction 190, result has 33.6 percent of original size [2019-11-22 11:10:55,281 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-22 11:10:55,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:55,427 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-22 11:10:55,428 INFO L567 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-11-22 11:10:55,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:10:55,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:28, output treesize:12 [2019-11-22 11:10:55,446 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-22 11:10:55,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:55,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:55,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:10:55,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2019-11-22 11:10:55,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 11:10:55,539 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-22 11:10:55,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:10:55,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:10:55,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 11:10:55,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 11:10:55,632 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-22 11:10:55,633 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 11:10:55,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:56,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:10:56,811 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-22 11:10:56,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 11:10:57,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 11:10:57,023 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:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-22 11:10:57,030 INFO L168 Benchmark]: Toolchain (without parser) took 60808.80 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 422.6 MB). Free memory was 953.7 MB in the beginning and 1.3 GB in the end (delta: -315.1 MB). Peak memory consumption was 107.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:10:57,030 INFO L168 Benchmark]: CDTParser took 0.34 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-22 11:10:57,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:10:57,031 INFO L168 Benchmark]: Boogie Preprocessor took 91.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-22 11:10:57,031 INFO L168 Benchmark]: RCFGBuilder took 895.82 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.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. [2019-11-22 11:10:57,032 INFO L168 Benchmark]: TraceAbstraction took 59114.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 276.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -231.1 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:10:57,034 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.34 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 703.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 895.82 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.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59114.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 276.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -231.1 MB). Peak memory consumption was 45.7 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:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...