/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:23:33,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:23:33,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:23:33,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:23:33,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:23:33,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:23:33,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:23:33,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:23:33,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:23:33,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:23:33,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:23:33,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:23:33,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:23:33,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:23:33,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:23:33,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:23:33,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:23:33,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:23:33,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:23:33,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:23:33,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:23:33,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:23:33,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:23:33,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:23:33,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:23:33,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:23:33,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:23:33,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:23:33,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:23:33,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:23:33,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:23:33,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:23:33,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:23:33,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:23:33,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:23:33,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:23:33,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:23:33,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:23:33,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:23:33,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:23:33,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:23:33,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 19:23:33,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:23:33,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:23:33,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:23:33,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:23:33,431 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:23:33,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:23:33,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:23:33,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:23:33,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:23:33,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:23:33,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:23:33,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:23:33,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:23:33,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:23:33,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:23:33,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:23:33,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:23:33,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:23:33,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:23:33,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:23:33,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:23:33,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:23:33,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:23:33,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:23:33,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:23:33,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:23:33,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:23:33,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:23:33,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:23:33,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:23:33,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:23:33,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:23:33,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:23:33,755 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:23:33,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i [2019-11-06 19:23:33,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22aa89fa/dfb1a1d013ea4f44816262463f145418/FLAGb25f9d333 [2019-11-06 19:23:34,391 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:23:34,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-1.i [2019-11-06 19:23:34,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22aa89fa/dfb1a1d013ea4f44816262463f145418/FLAGb25f9d333 [2019-11-06 19:23:34,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22aa89fa/dfb1a1d013ea4f44816262463f145418 [2019-11-06 19:23:34,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:23:34,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:23:34,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:34,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:23:34,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:23:34,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:34" (1/1) ... [2019-11-06 19:23:34,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a6c2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:34, skipping insertion in model container [2019-11-06 19:23:34,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:23:34" (1/1) ... [2019-11-06 19:23:34,676 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:23:34,728 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:23:35,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:35,165 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:23:35,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:23:35,278 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:23:35,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35 WrapperNode [2019-11-06 19:23:35,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:23:35,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:23:35,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:23:35,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:23:35,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35" (1/1) ... [2019-11-06 19:23:35,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35" (1/1) ... [2019-11-06 19:23:35,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35" (1/1) ... [2019-11-06 19:23:35,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35" (1/1) ... [2019-11-06 19:23:35,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35" (1/1) ... [2019-11-06 19:23:35,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35" (1/1) ... [2019-11-06 19:23:35,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35" (1/1) ... [2019-11-06 19:23:35,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:23:35,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:23:35,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:23:35,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:23:35,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23: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-06 19:23:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:23:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:23:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:23:35,398 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:23:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:23:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:23:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:23:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:23:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:23:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:23:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:23:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:23:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:23:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:23:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:23:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:23:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:23:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:23:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:23:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:23:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:23:35,403 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:23:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:23:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:23:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:23:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:23:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:23:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:23:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:23:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:23:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:23:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:23:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:23:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:23:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:23:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:23:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:23:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:23:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:23:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:23:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:23:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:23:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:23:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:23:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:23:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:23:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:23:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:23:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:23:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:23:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:23:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:23:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:23:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:23:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:23:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:23:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:23:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:23:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:23:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:23:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:23:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:23:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:23:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:23:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:23:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:23:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:23:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:23:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:23:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:23:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:23:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:23:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:23:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:23:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:23:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:23:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:23:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:23:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:23:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:23:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:23:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:23:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:23:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:23:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:23:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:23:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:23:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:23:35,995 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:23:35,995 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-06 19:23:35,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:35 BoogieIcfgContainer [2019-11-06 19:23:35,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:23:35,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:23:35,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:23:36,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:23:36,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:23:34" (1/3) ... [2019-11-06 19:23:36,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ebf1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:36, skipping insertion in model container [2019-11-06 19:23:36,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:23:35" (2/3) ... [2019-11-06 19:23:36,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ebf1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:36, skipping insertion in model container [2019-11-06 19:23:36,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:35" (3/3) ... [2019-11-06 19:23:36,005 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2019-11-06 19:23:36,015 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:23:36,022 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-06 19:23:36,033 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-06 19:23:36,059 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:23:36,059 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:23:36,059 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:23:36,060 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:23:36,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:23:36,060 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:23:36,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:23:36,064 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:23:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-06 19:23:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 19:23:36,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:36,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:36,104 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash -742552803, now seen corresponding path program 1 times [2019-11-06 19:23:36,120 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:36,120 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227947578] [2019-11-06 19:23:36,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,312 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-06 19:23:36,313 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227947578] [2019-11-06 19:23:36,314 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:36,314 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 19:23:36,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035781477] [2019-11-06 19:23:36,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:23:36,326 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:36,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:23:36,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 19:23:36,344 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-11-06 19:23:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:36,473 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2019-11-06 19:23:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:23:36,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-06 19:23:36,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:36,484 INFO L225 Difference]: With dead ends: 67 [2019-11-06 19:23:36,485 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 19:23:36,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 19:23:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 19:23:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-06 19:23:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 19:23:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-06 19:23:36,529 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2019-11-06 19:23:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:36,529 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-06 19:23:36,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:23:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-06 19:23:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 19:23:36,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:36,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:36,531 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1556669446, now seen corresponding path program 1 times [2019-11-06 19:23:36,531 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:36,532 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615643223] [2019-11-06 19:23:36,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:36,664 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-06 19:23:36,665 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615643223] [2019-11-06 19:23:36,665 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:36,665 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:23:36,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387128006] [2019-11-06 19:23:36,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:23:36,667 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:36,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:23:36,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:23:36,668 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2019-11-06 19:23:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:36,816 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-11-06 19:23:36,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:23:36,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-06 19:23:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:36,818 INFO L225 Difference]: With dead ends: 37 [2019-11-06 19:23:36,818 INFO L226 Difference]: Without dead ends: 35 [2019-11-06 19:23:36,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-06 19:23:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-11-06 19:23:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 19:23:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-06 19:23:36,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2019-11-06 19:23:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:36,831 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-06 19:23:36,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:23:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-06 19:23:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:23:36,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:36,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:36,832 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1973625457, now seen corresponding path program 1 times [2019-11-06 19:23:36,834 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:36,835 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186685737] [2019-11-06 19:23:36,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:37,018 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-06 19:23:37,018 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186685737] [2019-11-06 19:23:37,019 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:37,019 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:37,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890955758] [2019-11-06 19:23:37,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:37,020 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:37,023 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2019-11-06 19:23:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:37,186 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-06 19:23:37,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:37,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-06 19:23:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:37,188 INFO L225 Difference]: With dead ends: 54 [2019-11-06 19:23:37,188 INFO L226 Difference]: Without dead ends: 52 [2019-11-06 19:23:37,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-06 19:23:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-06 19:23:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2019-11-06 19:23:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-06 19:23:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-06 19:23:37,197 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 14 [2019-11-06 19:23:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:37,197 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-06 19:23:37,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-06 19:23:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 19:23:37,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:37,199 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:37,199 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash -954667545, now seen corresponding path program 1 times [2019-11-06 19:23:37,200 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:37,200 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343710096] [2019-11-06 19:23:37,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:37,483 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-06 19:23:37,486 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343710096] [2019-11-06 19:23:37,486 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998275706] [2019-11-06 19:23:37,487 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-06 19:23:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:37,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-06 19:23:37,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:37,768 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-06 19:23:37,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-06 19:23:37,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:23:37,802 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:37,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:29 [2019-11-06 19:23:37,904 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:37,905 INFO L375 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-06 19:23:37,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:37,966 INFO L567 ElimStorePlain]: treesize reduction 14, result has 81.1 percent of original size [2019-11-06 19:23:37,975 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:38,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-11-06 19:23:38,039 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,062 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2019-11-06 19:23:38,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 19:23:38,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,170 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_29|, |v_#memory_int_30|], 4=[|v_#memory_int_32|]} [2019-11-06 19:23:38,174 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:38,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,203 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:38,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:38,251 INFO L341 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2019-11-06 19:23:38,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2019-11-06 19:23:38,253 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:38,284 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:80, output treesize:43 [2019-11-06 19:23:38,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 13 [2019-11-06 19:23:38,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:38,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:38,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-06 19:23:38,392 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-06 19:23:38,393 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:38,393 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-06 19:23:38,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237051881] [2019-11-06 19:23:38,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 19:23:38,394 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:38,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 19:23:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-06 19:23:38,395 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 12 states. [2019-11-06 19:23:40,350 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-06 19:23:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:40,846 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-11-06 19:23:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 19:23:40,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-11-06 19:23:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:40,849 INFO L225 Difference]: With dead ends: 62 [2019-11-06 19:23:40,849 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 19:23:40,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-11-06 19:23:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 19:23:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 27. [2019-11-06 19:23:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 19:23:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-06 19:23:40,856 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-11-06 19:23:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:40,857 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-06 19:23:40,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 19:23:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-06 19:23:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 19:23:40,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:40,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:41,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:41,063 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:41,063 INFO L82 PathProgramCache]: Analyzing trace with hash 903516662, now seen corresponding path program 1 times [2019-11-06 19:23:41,064 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:41,064 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491623895] [2019-11-06 19:23:41,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,171 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-06 19:23:41,172 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491623895] [2019-11-06 19:23:41,172 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:23:41,172 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:23:41,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856479595] [2019-11-06 19:23:41,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:23:41,173 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:41,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:23:41,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:23:41,174 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2019-11-06 19:23:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:41,313 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-06 19:23:41,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 19:23:41,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 19:23:41,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:41,314 INFO L225 Difference]: With dead ends: 42 [2019-11-06 19:23:41,315 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 19:23:41,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:23:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 19:23:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-06 19:23:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 19:23:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-06 19:23:41,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2019-11-06 19:23:41,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:41,321 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-06 19:23:41,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:23:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-06 19:23:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 19:23:41,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:41,322 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:41,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1223911862, now seen corresponding path program 1 times [2019-11-06 19:23:41,323 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:41,323 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660070321] [2019-11-06 19:23:41,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,421 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-06 19:23:41,421 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660070321] [2019-11-06 19:23:41,422 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192591792] [2019-11-06 19:23:41,422 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-06 19:23:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:41,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 19:23:41,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:41,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:41,605 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-11-06 19:23:41,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 38 treesize of output 48 [2019-11-06 19:23:41,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,662 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.4 percent of original size [2019-11-06 19:23:41,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:41,716 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-11-06 19:23:41,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 38 treesize of output 48 [2019-11-06 19:23:41,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,781 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.7 percent of original size [2019-11-06 19:23:41,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:63 [2019-11-06 19:23:41,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:41,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:41,911 INFO L375 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 37 treesize of output 25 [2019-11-06 19:23:41,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,918 INFO L375 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 29 treesize of output 21 [2019-11-06 19:23:41,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,933 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:41,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2019-11-06 19:23:41,935 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:41,988 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-11-06 19:23:41,993 INFO L375 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 18 treesize of output 10 [2019-11-06 19:23:41,995 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:42,011 INFO L375 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 22 treesize of output 10 [2019-11-06 19:23:42,011 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:42,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:42,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2019-11-06 19:23:42,022 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:42,035 INFO L567 ElimStorePlain]: treesize reduction 20, result has 25.9 percent of original size [2019-11-06 19:23:42,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:42,036 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:110, output treesize:7 [2019-11-06 19:23:42,052 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-06 19:23:42,053 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:42,053 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-11-06 19:23:42,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022332377] [2019-11-06 19:23:42,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:23:42,054 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:42,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:23:42,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:23:42,054 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2019-11-06 19:23:42,253 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-06 19:23:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:42,520 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-11-06 19:23:42,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:23:42,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-06 19:23:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:42,522 INFO L225 Difference]: With dead ends: 53 [2019-11-06 19:23:42,522 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 19:23:42,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:23:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 19:23:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-06 19:23:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 19:23:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-06 19:23:42,528 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2019-11-06 19:23:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:42,529 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-06 19:23:42,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:23:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-06 19:23:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:23:42,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:42,530 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] [2019-11-06 19:23:42,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:42,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:42,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1223476830, now seen corresponding path program 1 times [2019-11-06 19:23:42,736 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:42,736 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953733213] [2019-11-06 19:23:42,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,031 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-06 19:23:43,032 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953733213] [2019-11-06 19:23:43,032 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126200972] [2019-11-06 19:23:43,032 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-06 19:23:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:43,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-06 19:23:43,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:43,176 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-06 19:23:43,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-06 19:23:43,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2019-11-06 19:23:43,321 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-06 19:23:43,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-11-06 19:23:43,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,404 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.0 percent of original size [2019-11-06 19:23:43,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:43,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,469 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.4 percent of original size [2019-11-06 19:23:43,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:43,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:43,476 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,499 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:54 [2019-11-06 19:23:43,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:43,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,604 INFO L375 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 25 treesize of output 49 [2019-11-06 19:23:43,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:43,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,678 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|], 4=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|]} [2019-11-06 19:23:43,682 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:43,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,775 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:43,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:43,882 INFO L341 Elim1Store]: treesize reduction 16, result has 80.5 percent of original size [2019-11-06 19:23:43,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 134 [2019-11-06 19:23:43,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:43,894 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,022 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-11-06 19:23:44,022 INFO L567 ElimStorePlain]: treesize reduction 426, result has 22.0 percent of original size [2019-11-06 19:23:44,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:44,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:44,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:44,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 73 [2019-11-06 19:23:44,034 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:44,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,055 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:219, output treesize:72 [2019-11-06 19:23:44,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:44,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:44,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:44,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2019-11-06 19:23:44,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:44,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:44,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:46 [2019-11-06 19:23:44,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:44,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2019-11-06 19:23:44,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:44,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,220 INFO L567 ElimStorePlain]: treesize reduction 9, result has 50.0 percent of original size [2019-11-06 19:23:44,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:44,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:4 [2019-11-06 19:23:44,243 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-06 19:23:44,244 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:44,244 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-11-06 19:23:44,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385210106] [2019-11-06 19:23:44,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 19:23:44,245 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:44,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 19:23:44,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:23:44,246 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 17 states. [2019-11-06 19:23:44,963 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-06 19:23:45,291 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-06 19:23:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:45,920 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2019-11-06 19:23:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 19:23:45,921 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-06 19:23:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:45,922 INFO L225 Difference]: With dead ends: 85 [2019-11-06 19:23:45,922 INFO L226 Difference]: Without dead ends: 83 [2019-11-06 19:23:45,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2019-11-06 19:23:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-06 19:23:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2019-11-06 19:23:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-06 19:23:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-06 19:23:45,931 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2019-11-06 19:23:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:45,932 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-06 19:23:45,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 19:23:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-11-06 19:23:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:23:45,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:45,933 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] [2019-11-06 19:23:46,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:46,136 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2050422112, now seen corresponding path program 1 times [2019-11-06 19:23:46,137 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:46,138 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733167797] [2019-11-06 19:23:46,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,412 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-06 19:23:46,412 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733167797] [2019-11-06 19:23:46,413 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473198114] [2019-11-06 19:23:46,413 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-06 19:23:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:46,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 19:23:46,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:46,541 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-06 19:23:46,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-06 19:23:46,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,553 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-06 19:23:46,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-11-06 19:23:46,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:23:46,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:46,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:46,674 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,691 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:68, output treesize:22 [2019-11-06 19:23:46,724 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 2=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_29|]} [2019-11-06 19:23:46,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-06 19:23:46,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2019-11-06 19:23:46,753 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 61 [2019-11-06 19:23:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:46,786 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,800 INFO L567 ElimStorePlain]: treesize reduction 28, result has 49.1 percent of original size [2019-11-06 19:23:46,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,801 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:89, output treesize:27 [2019-11-06 19:23:46,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:46,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 19:23:46,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-06 19:23:46,901 INFO L375 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-06 19:23:46,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:46,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:46,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 19:23:46,924 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-06 19:23:46,924 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:46,924 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-11-06 19:23:46,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059343547] [2019-11-06 19:23:46,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 19:23:46,925 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:46,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 19:23:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-11-06 19:23:46,926 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 19 states. [2019-11-06 19:23:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:47,854 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-06 19:23:47,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 19:23:47,854 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-06 19:23:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:47,856 INFO L225 Difference]: With dead ends: 91 [2019-11-06 19:23:47,857 INFO L226 Difference]: Without dead ends: 79 [2019-11-06 19:23:47,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2019-11-06 19:23:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-06 19:23:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 58. [2019-11-06 19:23:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 19:23:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-11-06 19:23:47,868 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 24 [2019-11-06 19:23:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:47,869 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-11-06 19:23:47,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 19:23:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-11-06 19:23:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:47,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:47,870 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] [2019-11-06 19:23:48,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:48,082 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:48,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1509760762, now seen corresponding path program 1 times [2019-11-06 19:23:48,083 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:48,083 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955802756] [2019-11-06 19:23:48,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:48,448 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-06 19:23:48,448 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955802756] [2019-11-06 19:23:48,449 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024840182] [2019-11-06 19:23:48,449 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-06 19:23:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:48,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-06 19:23:48,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:48,591 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-06 19:23:48,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-06 19:23:48,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:48,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:48,607 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-06 19:23:48,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-06 19:23:48,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:48,641 INFO L375 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-06 19:23:48,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:48,705 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-11-06 19:23:48,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:48,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:48,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:48,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:48,741 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:48,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:48,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:48,764 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:52 [2019-11-06 19:23:48,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:48,842 INFO L375 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 20 treesize of output 30 [2019-11-06 19:23:48,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:48,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:48,936 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 1=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|]} [2019-11-06 19:23:48,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:48,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,055 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:49,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,121 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-06 19:23:49,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 43 [2019-11-06 19:23:49,189 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,301 INFO L341 Elim1Store]: treesize reduction 16, result has 80.5 percent of original size [2019-11-06 19:23:49,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 101 [2019-11-06 19:23:49,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,306 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,409 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-11-06 19:23:49,409 INFO L567 ElimStorePlain]: treesize reduction 177, result has 34.2 percent of original size [2019-11-06 19:23:49,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,411 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:228, output treesize:98 [2019-11-06 19:23:49,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,661 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-06 19:23:49,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 81 [2019-11-06 19:23:49,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,670 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:49,735 INFO L567 ElimStorePlain]: treesize reduction 12, result has 87.1 percent of original size [2019-11-06 19:23:49,835 INFO L341 Elim1Store]: treesize reduction 72, result has 47.4 percent of original size [2019-11-06 19:23:49,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 70 treesize of output 105 [2019-11-06 19:23:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-06 19:23:49,888 INFO L567 ElimStorePlain]: treesize reduction 38, result has 49.3 percent of original size [2019-11-06 19:23:49,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:49,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:11 [2019-11-06 19:23:49,904 INFO L375 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-06 19:23:49,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:49,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:49,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 19:23:49,914 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-06 19:23:49,914 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:49,914 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-11-06 19:23:49,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741932793] [2019-11-06 19:23:49,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 19:23:49,915 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:49,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 19:23:49,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:23:49,916 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 16 states. [2019-11-06 19:23:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:51,479 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2019-11-06 19:23:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 19:23:51,480 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-11-06 19:23:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:51,481 INFO L225 Difference]: With dead ends: 121 [2019-11-06 19:23:51,481 INFO L226 Difference]: Without dead ends: 119 [2019-11-06 19:23:51,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-11-06 19:23:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-06 19:23:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2019-11-06 19:23:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-06 19:23:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-06 19:23:51,497 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-06 19:23:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:51,497 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-06 19:23:51,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 19:23:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-06 19:23:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:51,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:51,498 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:51,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:51,702 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:51,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1670120370, now seen corresponding path program 2 times [2019-11-06 19:23:51,703 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:51,704 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982775697] [2019-11-06 19:23:51,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:52,338 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982775697] [2019-11-06 19:23:52,339 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854335226] [2019-11-06 19:23:52,339 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-06 19:23:52,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:23:52,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:52,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-06 19:23:52,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:52,478 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-06 19:23:52,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-06 19:23:52,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:52,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:52,491 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-06 19:23:52,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-06 19:23:52,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:52,521 INFO L375 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-06 19:23:52,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:52,588 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.8 percent of original size [2019-11-06 19:23:52,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:52,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:52,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:52,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:52,625 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:52,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:52,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:52,645 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:52 [2019-11-06 19:23:52,735 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:52,735 INFO L375 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 20 treesize of output 30 [2019-11-06 19:23:52,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:52,891 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-06 19:23:52,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:52,894 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_int_35|, |v_#memory_int_36|], 4=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.offset_35|, |v_#memory_$Pointer$.base_33|]} [2019-11-06 19:23:52,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2019-11-06 19:23:52,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,045 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-06 19:23:53,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,049 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:53,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:53,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2019-11-06 19:23:53,150 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,241 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 150 [2019-11-06 19:23:53,243 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,358 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-06 19:23:53,359 INFO L567 ElimStorePlain]: treesize reduction 24, result has 89.8 percent of original size [2019-11-06 19:23:53,363 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:53,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:53,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2019-11-06 19:23:53,418 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:53,547 INFO L341 Elim1Store]: treesize reduction 33, result has 68.6 percent of original size [2019-11-06 19:23:53,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 111 [2019-11-06 19:23:53,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:53,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:53,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:53,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:53,552 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2019-11-06 19:23:53,670 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-11-06 19:23:53,670 INFO L567 ElimStorePlain]: treesize reduction 401, result has 18.5 percent of original size [2019-11-06 19:23:53,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:53,672 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:277, output treesize:82 [2019-11-06 19:23:53,775 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-06 19:23:53,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 46 [2019-11-06 19:23:53,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:53,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:53,784 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-06 19:23:53,824 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-06 19:23:53,828 INFO L375 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 22 treesize of output 10 [2019-11-06 19:23:53,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:53,843 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:24 [2019-11-06 19:23:53,886 INFO L375 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 24 treesize of output 10 [2019-11-06 19:23:53,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:53,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:53,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-06 19:23:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:53,915 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:23:53,915 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2019-11-06 19:23:53,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479623472] [2019-11-06 19:23:53,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 19:23:53,916 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:23:53,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 19:23:53,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-06 19:23:53,917 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 18 states. [2019-11-06 19:23:54,308 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2019-11-06 19:23:54,671 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-06 19:23:55,127 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-11-06 19:23:55,282 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2019-11-06 19:23:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:23:55,662 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-11-06 19:23:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 19:23:55,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-11-06 19:23:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:23:55,663 INFO L225 Difference]: With dead ends: 123 [2019-11-06 19:23:55,663 INFO L226 Difference]: Without dead ends: 101 [2019-11-06 19:23:55,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-11-06 19:23:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-06 19:23:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2019-11-06 19:23:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-06 19:23:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2019-11-06 19:23:55,675 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 27 [2019-11-06 19:23:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:23:55,675 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2019-11-06 19:23:55,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 19:23:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2019-11-06 19:23:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:23:55,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:23:55,682 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:23:55,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:23:55,883 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:23:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:23:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1148340406, now seen corresponding path program 3 times [2019-11-06 19:23:55,884 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:23:55,884 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66527718] [2019-11-06 19:23:55,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:23:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:23:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:23:56,277 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66527718] [2019-11-06 19:23:56,277 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516053364] [2019-11-06 19:23:56,277 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-06 19:23:56,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 19:23:56,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:23:56,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-06 19:23:56,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:23:56,466 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-06 19:23:56,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-06 19:23:56,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:23 [2019-11-06 19:23:56,595 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-06 19:23:56,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-11-06 19:23:56,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,704 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-06 19:23:56,705 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.7 percent of original size [2019-11-06 19:23:56,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:56,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,779 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size [2019-11-06 19:23:56,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 19:23:56,786 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:56,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:56,813 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:85, output treesize:57 [2019-11-06 19:23:56,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:56,980 INFO L341 Elim1Store]: treesize reduction 8, result has 92.7 percent of original size [2019-11-06 19:23:56,980 INFO L375 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 7 case distinctions, treesize of input 31 treesize of output 119 [2019-11-06 19:23:56,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,222 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-11-06 19:23:57,222 INFO L567 ElimStorePlain]: treesize reduction 54, result has 82.0 percent of original size [2019-11-06 19:23:57,230 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:57,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:57,434 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-11-06 19:23:57,434 INFO L341 Elim1Store]: treesize reduction 124, result has 41.2 percent of original size [2019-11-06 19:23:57,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 166 [2019-11-06 19:23:57,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:57,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:57,439 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,608 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-11-06 19:23:57,609 INFO L567 ElimStorePlain]: treesize reduction 49, result has 78.9 percent of original size [2019-11-06 19:23:57,611 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-06 19:23:57,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2019-11-06 19:23:57,679 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,720 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:236, output treesize:87 [2019-11-06 19:23:57,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:57,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,828 INFO L375 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 38 treesize of output 68 [2019-11-06 19:23:57,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,916 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_40|], 18=[|v_#memory_$Pointer$.base_40|]} [2019-11-06 19:23:57,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 36 [2019-11-06 19:23:57,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:57,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:57,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:58,138 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-06 19:23:58,139 INFO L341 Elim1Store]: treesize reduction 19, result has 86.8 percent of original size [2019-11-06 19:23:58,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 158 treesize of output 172 [2019-11-06 19:23:58,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:58,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:58,217 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:58,432 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-11-06 19:23:58,433 INFO L567 ElimStorePlain]: treesize reduction 1489, result has 7.8 percent of original size [2019-11-06 19:23:58,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:58,434 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:250, output treesize:125 [2019-11-06 19:23:58,497 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_38|], 1=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|], 10=[|v_#memory_$Pointer$.offset_41|], 15=[|v_#memory_$Pointer$.base_41|]} [2019-11-06 19:23:58,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 19:23:58,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:58,645 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-06 19:23:58,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:58,649 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:58,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:58,747 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:23:58,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:23:58,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:58,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:58,993 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-06 19:23:58,993 INFO L341 Elim1Store]: treesize reduction 91, result has 69.6 percent of original size [2019-11-06 19:23:58,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 130 treesize of output 224 [2019-11-06 19:23:58,994 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:23:59,163 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-06 19:23:59,163 INFO L567 ElimStorePlain]: treesize reduction 115, result has 72.8 percent of original size [2019-11-06 19:23:59,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:23:59,169 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:23:59,469 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-11-06 19:23:59,470 INFO L341 Elim1Store]: treesize reduction 125, result has 63.1 percent of original size [2019-11-06 19:23:59,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 281 treesize of output 290 [2019-11-06 19:23:59,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:59,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:59,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:59,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:59,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:59,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:23:59,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:23:59,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:23:59,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:24:00,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:24:00,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:24:00,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:24:00,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,055 INFO L496 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:00,466 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 87 [2019-11-06 19:24:00,467 INFO L567 ElimStorePlain]: treesize reduction 135, result has 55.7 percent of original size [2019-11-06 19:24:00,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:24:00,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:00,542 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:432, output treesize:1771 [2019-11-06 19:24:00,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:00,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:01,957 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 341 DAG size of output: 206 [2019-11-06 19:24:01,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:02,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:03,287 WARN L191 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 206 [2019-11-06 19:24:03,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:24:03,353 INFO L392 ElimStorePlain]: Different costs {5=[|#memory_$Pointer$.offset|], 6=[v_prenex_17], 11=[v_prenex_10, v_prenex_13, v_prenex_15]} [2019-11-06 19:24:03,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 120 [2019-11-06 19:24:03,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:04,040 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 210 [2019-11-06 19:24:04,041 INFO L567 ElimStorePlain]: treesize reduction 164, result has 84.1 percent of original size [2019-11-06 19:24:04,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:04,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 173 [2019-11-06 19:24:04,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:04,709 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 198 [2019-11-06 19:24:04,710 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.1 percent of original size [2019-11-06 19:24:04,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:04,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 141 [2019-11-06 19:24:04,729 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,012 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-11-06 19:24:05,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:05,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:05,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:05,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 216 [2019-11-06 19:24:05,039 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,414 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 173 [2019-11-06 19:24:05,414 INFO L567 ElimStorePlain]: treesize reduction 36, result has 95.0 percent of original size [2019-11-06 19:24:05,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:05,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:05,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 127 [2019-11-06 19:24:05,427 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:05,593 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-11-06 19:24:05,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:05,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 5 dim-2 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-11-06 19:24:05,598 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 16 variables, input treesize:1070, output treesize:635 [2019-11-06 19:24:05,876 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-11-06 19:24:05,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 19:24:05,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:05,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 152 [2019-11-06 19:24:05,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:06,166 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 131 [2019-11-06 19:24:06,166 INFO L567 ElimStorePlain]: treesize reduction 178, result has 72.7 percent of original size [2019-11-06 19:24:06,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:06,176 INFO L375 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 142 treesize of output 120 [2019-11-06 19:24:06,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:06,291 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-06 19:24:06,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:06,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:06,308 INFO L375 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 81 treesize of output 67 [2019-11-06 19:24:06,308 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:06,413 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-06 19:24:06,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:06,427 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:24:06,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 95 [2019-11-06 19:24:06,428 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:06,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:06,523 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-11-06 19:24:06,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 5 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2019-11-06 19:24:06,526 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:685, output treesize:406 [2019-11-06 19:24:06,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 19:24:06,717 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.base|], 9=[v_prenex_22], 14=[v_prenex_24, v_prenex_27]} [2019-11-06 19:24:06,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:06,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 80 [2019-11-06 19:24:06,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:06,868 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2019-11-06 19:24:06,868 INFO L567 ElimStorePlain]: treesize reduction 128, result has 69.0 percent of original size [2019-11-06 19:24:06,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:06,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 100 [2019-11-06 19:24:06,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:06,914 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:07,050 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-11-06 19:24:07,051 INFO L567 ElimStorePlain]: treesize reduction 48, result has 80.9 percent of original size [2019-11-06 19:24:07,051 INFO L464 ElimStorePlain]: Eliminatee v_prenex_24 vanished before elimination [2019-11-06 19:24:07,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:07,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 143 [2019-11-06 19:24:07,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:07,227 INFO L496 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:07,365 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-11-06 19:24:07,366 INFO L567 ElimStorePlain]: treesize reduction 68, result has 63.2 percent of original size [2019-11-06 19:24:07,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-06 19:24:07,367 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:426, output treesize:18 [2019-11-06 19:24:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:07,454 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:07,454 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-06 19:24:07,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895065403] [2019-11-06 19:24:07,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 19:24:07,455 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 19:24:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-06 19:24:07,456 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 20 states. [2019-11-06 19:24:09,075 WARN L191 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 233 [2019-11-06 19:24:09,507 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 146