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-simple-white-blue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:01:32,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:01:32,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:01:32,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:01:32,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:01:32,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:01:32,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:01:32,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:01:32,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:01:32,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:01:32,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:01:32,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:01:32,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:01:32,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:01:32,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:01:32,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:01:32,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:01:32,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:01:32,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:01:32,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:01:32,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:01:32,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:01:32,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:01:32,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:01:32,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:01:32,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:01:32,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:01:32,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:01:32,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:01:32,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:01:32,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:01:32,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:01:32,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:01:32,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:01:32,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:01:32,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:01:32,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:01:32,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:01:32,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:01:32,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:01:32,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:01:32,396 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-09-20 13:01:32,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:01:32,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:01:32,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:01:32,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:01:32,438 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:01:32,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:01:32,439 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:01:32,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:01:32,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:01:32,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:01:32,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:01:32,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:01:32,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:01:32,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:01:32,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:01:32,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:01:32,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:01:32,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:01:32,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:01:32,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:01:32,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:01:32,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:01:32,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:01:32,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:01:32,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:01:32,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:01:32,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:01:32,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:01:32,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:01:32,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:01:32,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:01:32,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:01:32,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:01:32,515 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:01:32,516 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i [2019-09-20 13:01:32,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5293d598/3f65946a581d444a8b900814cceba0a6/FLAGf77b17013 [2019-09-20 13:01:33,113 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:01:33,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i [2019-09-20 13:01:33,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5293d598/3f65946a581d444a8b900814cceba0a6/FLAGf77b17013 [2019-09-20 13:01:33,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5293d598/3f65946a581d444a8b900814cceba0a6 [2019-09-20 13:01:33,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:01:33,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:01:33,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:33,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:01:33,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:01:33,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:33" (1/1) ... [2019-09-20 13:01:33,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3b3780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:33, skipping insertion in model container [2019-09-20 13:01:33,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:01:33" (1/1) ... [2019-09-20 13:01:33,472 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:01:33,518 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:01:33,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:33,951 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:01:34,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:01:34,069 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:01:34,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34 WrapperNode [2019-09-20 13:01:34,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:01:34,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:01:34,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:01:34,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:01:34,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (1/1) ... [2019-09-20 13:01:34,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (1/1) ... [2019-09-20 13:01:34,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (1/1) ... [2019-09-20 13:01:34,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (1/1) ... [2019-09-20 13:01:34,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (1/1) ... [2019-09-20 13:01:34,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (1/1) ... [2019-09-20 13:01:34,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (1/1) ... [2019-09-20 13:01:34,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:01:34,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:01:34,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:01:34,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:01:34,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (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-09-20 13:01:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:01:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:01:34,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:01:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:01:34,198 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:01:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:01:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:01:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:01:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:01:34,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:01:34,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:01:34,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:01:34,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:01:34,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:01:34,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:01:34,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:01:34,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:01:34,201 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:01:34,201 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:01:34,201 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:01:34,201 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:01:34,201 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:01:34,202 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:01:34,202 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:01:34,202 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:01:34,202 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:01:34,202 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:01:34,202 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:01:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:01:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:01:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:01:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:01:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:01:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:01:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:01:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:01:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:01:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:01:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:01:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:01:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:01:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:01:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:01:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:01:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:01:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:01:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:01:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:01:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:01:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:01:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:01:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:01:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:01:34,207 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:01:34,207 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:01:34,207 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:01:34,207 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:01:34,207 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:01:34,207 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:01:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:01:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:01:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:01:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:01:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:01:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:01:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:01:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:01:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:01:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:01:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:01:34,209 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:01:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:01:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:01:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:01:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:01:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:01:34,210 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:01:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:01:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:01:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:01:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:01:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:01:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:01:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:01:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:01:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:01:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:01:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:01:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:01:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:01:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:01:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:01:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:01:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:01:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:01:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:01:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:01:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:01:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:01:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:01:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:01:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:01:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:01:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:01:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:01:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:01:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:01:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:01:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:01:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:01:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:01:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:01:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:01:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:01:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:01:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:01:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:01:34,753 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:01:34,753 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-09-20 13:01:34,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:34 BoogieIcfgContainer [2019-09-20 13:01:34,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:01:34,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:01:34,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:01:34,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:01:34,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:01:33" (1/3) ... [2019-09-20 13:01:34,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7231210d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:34, skipping insertion in model container [2019-09-20 13:01:34,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:01:34" (2/3) ... [2019-09-20 13:01:34,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7231210d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:01:34, skipping insertion in model container [2019-09-20 13:01:34,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:01:34" (3/3) ... [2019-09-20 13:01:34,763 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2019-09-20 13:01:34,773 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:01:34,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:01:34,798 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:01:34,828 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:01:34,829 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:01:34,829 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:01:34,829 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:01:34,829 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:01:34,830 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:01:34,830 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:01:34,830 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:01:34,830 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:01:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-20 13:01:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:01:34,854 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:34,855 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:34,857 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1759752198, now seen corresponding path program 1 times [2019-09-20 13:01:34,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:34,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:34,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:34,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:34,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:35,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:35,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:01:35,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:01:35,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:01:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:01:35,048 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-20 13:01:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:35,069 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2019-09-20 13:01:35,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:01:35,071 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-20 13:01:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:35,081 INFO L225 Difference]: With dead ends: 53 [2019-09-20 13:01:35,081 INFO L226 Difference]: Without dead ends: 23 [2019-09-20 13:01:35,085 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:01:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-20 13:01:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-20 13:01:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 13:01:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-09-20 13:01:35,132 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2019-09-20 13:01:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:35,132 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-09-20 13:01:35,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:01:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-09-20 13:01:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:01:35,134 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:35,134 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:35,134 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:35,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:35,135 INFO L82 PathProgramCache]: Analyzing trace with hash -666433660, now seen corresponding path program 1 times [2019-09-20 13:01:35,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:35,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:35,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:35,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:35,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:35,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:35,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:01:35,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:01:35,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:01:35,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:01:35,524 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 7 states. [2019-09-20 13:01:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:35,811 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-09-20 13:01:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:01:35,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-20 13:01:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:35,814 INFO L225 Difference]: With dead ends: 47 [2019-09-20 13:01:35,814 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:01:35,815 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:01:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:01:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-09-20 13:01:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 13:01:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-09-20 13:01:35,823 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2019-09-20 13:01:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:35,824 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-09-20 13:01:35,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:01:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-09-20 13:01:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:01:35,825 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:35,825 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:35,825 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:35,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:35,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1010508073, now seen corresponding path program 1 times [2019-09-20 13:01:35,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:35,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:35,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:35,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:35,966 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:36,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:36,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 13:01:36,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:36,170 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:36,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,195 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 22 treesize of output 7 [2019-09-20 13:01:36,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,212 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 22 treesize of output 7 [2019-09-20 13:01:36,213 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,223 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:20 [2019-09-20 13:01:36,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,260 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-09-20 13:01:36,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,305 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:36,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,332 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:36,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,361 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 24 treesize of output 27 [2019-09-20 13:01:36,362 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:36,388 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 24 treesize of output 27 [2019-09-20 13:01:36,390 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,407 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-09-20 13:01:36,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,520 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 69 treesize of output 52 [2019-09-20 13:01:36,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:36,529 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:36,548 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-09-20 13:01:36,553 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-09-20 13:01:36,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:36,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:36,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-09-20 13:01:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:36,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:36,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-20 13:01:36,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:01:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:01:36,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:01:36,585 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 10 states. [2019-09-20 13:01:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:37,070 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-09-20 13:01:37,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:01:37,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-09-20 13:01:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:37,072 INFO L225 Difference]: With dead ends: 74 [2019-09-20 13:01:37,072 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 13:01:37,074 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:01:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 13:01:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2019-09-20 13:01:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:01:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-09-20 13:01:37,093 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 19 [2019-09-20 13:01:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:37,093 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-09-20 13:01:37,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:01:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-09-20 13:01:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:01:37,098 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:37,098 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:37,098 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -687403823, now seen corresponding path program 1 times [2019-09-20 13:01:37,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:37,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:37,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:37,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:01:37,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:01:37,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:01:37,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:01:37,254 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 8 states. [2019-09-20 13:01:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:37,460 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2019-09-20 13:01:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:01:37,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-20 13:01:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:37,462 INFO L225 Difference]: With dead ends: 78 [2019-09-20 13:01:37,462 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 13:01:37,462 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:01:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 13:01:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-09-20 13:01:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-20 13:01:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-20 13:01:37,471 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 20 [2019-09-20 13:01:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:37,471 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-20 13:01:37,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:01:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-20 13:01:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:01:37,473 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:37,473 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:37,473 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1938777486, now seen corresponding path program 2 times [2019-09-20 13:01:37,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:37,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:01:37,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:37,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:01:37,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:01:37,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:01:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:01:37,585 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2019-09-20 13:01:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:37,682 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-09-20 13:01:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:01:37,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-20 13:01:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:37,683 INFO L225 Difference]: With dead ends: 59 [2019-09-20 13:01:37,684 INFO L226 Difference]: Without dead ends: 46 [2019-09-20 13:01:37,684 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:01:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-20 13:01:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2019-09-20 13:01:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-20 13:01:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-09-20 13:01:37,691 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 21 [2019-09-20 13:01:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:37,692 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-09-20 13:01:37,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:01:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-09-20 13:01:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:01:37,693 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:37,693 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:37,693 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1961949386, now seen corresponding path program 1 times [2019-09-20 13:01:37,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:37,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:37,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:01:37,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:01:37,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:01:37,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:01:37,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:01:37,777 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 7 states. [2019-09-20 13:01:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:37,922 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2019-09-20 13:01:37,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:01:37,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-20 13:01:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:37,927 INFO L225 Difference]: With dead ends: 63 [2019-09-20 13:01:37,927 INFO L226 Difference]: Without dead ends: 47 [2019-09-20 13:01:37,927 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:01:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-20 13:01:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-09-20 13:01:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:01:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-09-20 13:01:37,935 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2019-09-20 13:01:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:37,935 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-09-20 13:01:37,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:01:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-09-20 13:01:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:01:37,936 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:37,937 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:37,937 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash -361877940, now seen corresponding path program 1 times [2019-09-20 13:01:37,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:37,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:37,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:38,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:38,129 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:38,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:38,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-20 13:01:38,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:38,269 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:38,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:38,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,327 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-09-20 13:01:38,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,445 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-20 13:01:38,445 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2019-09-20 13:01:38,462 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:38,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,525 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:38,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,573 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 18 treesize of output 7 [2019-09-20 13:01:38,573 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,610 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 30 treesize of output 22 [2019-09-20 13:01:38,611 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,647 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 30 treesize of output 22 [2019-09-20 13:01:38,647 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,671 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-09-20 13:01:38,672 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:122, output treesize:66 [2019-09-20 13:01:38,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,767 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-09-20 13:01:38,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,819 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 1=[|v_#memory_int_23|, |v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|]} [2019-09-20 13:01:38,823 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:38,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,872 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:38,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:38,921 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 30 treesize of output 22 [2019-09-20 13:01:38,922 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:38,978 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.9 percent of original size [2019-09-20 13:01:38,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:38,991 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 33 treesize of output 39 [2019-09-20 13:01:38,991 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,042 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 2 case distinctions, treesize of input 56 treesize of output 77 [2019-09-20 13:01:39,044 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,106 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.4 percent of original size [2019-09-20 13:01:39,108 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-09-20 13:01:39,108 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:141, output treesize:90 [2019-09-20 13:01:39,361 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-09-20 13:01:39,361 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 121 treesize of output 90 [2019-09-20 13:01:39,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,369 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:39,403 INFO L567 ElimStorePlain]: treesize reduction 24, result has 73.0 percent of original size [2019-09-20 13:01:39,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:39,430 INFO L341 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-09-20 13:01:39,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 42 [2019-09-20 13:01:39,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,458 INFO L567 ElimStorePlain]: treesize reduction 8, result has 78.9 percent of original size [2019-09-20 13:01:39,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:39,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:30 [2019-09-20 13:01:39,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:39,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 30 [2019-09-20 13:01:39,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:39,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,555 INFO L567 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2019-09-20 13:01:39,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:39,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:3 [2019-09-20 13:01:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:39,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:39,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-09-20 13:01:39,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-20 13:01:39,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-20 13:01:39,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:01:39,595 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 17 states. [2019-09-20 13:01:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:40,938 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2019-09-20 13:01:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:01:40,941 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2019-09-20 13:01:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:40,943 INFO L225 Difference]: With dead ends: 97 [2019-09-20 13:01:40,943 INFO L226 Difference]: Without dead ends: 95 [2019-09-20 13:01:40,944 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:01:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-20 13:01:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 53. [2019-09-20 13:01:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-20 13:01:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-09-20 13:01:40,964 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 22 [2019-09-20 13:01:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:40,965 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-09-20 13:01:40,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-20 13:01:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-09-20 13:01:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:01:40,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:40,966 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:40,967 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:40,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash -319739169, now seen corresponding path program 2 times [2019-09-20 13:01:40,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:40,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:40,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:40,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:40,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:41,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:41,221 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:41,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:01:41,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:01:41,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:41,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-20 13:01:41,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:41,361 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:41,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:41,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,428 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-09-20 13:01:41,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,548 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-20 13:01:41,549 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.9 percent of original size [2019-09-20 13:01:41,574 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 31 treesize of output 7 [2019-09-20 13:01:41,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,605 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:41,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,633 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 30 treesize of output 22 [2019-09-20 13:01:41,634 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,660 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 19 treesize of output 18 [2019-09-20 13:01:41,661 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,681 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-09-20 13:01:41,681 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:104, output treesize:55 [2019-09-20 13:01:41,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,754 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-09-20 13:01:41,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,800 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|, |v_#memory_int_24|, |v_#memory_$Pointer$.offset_34|], 1=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-09-20 13:01:41,802 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:41,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,844 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 18 treesize of output 7 [2019-09-20 13:01:41,844 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:41,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,881 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:41,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:41,945 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 2 case distinctions, treesize of input 53 treesize of output 74 [2019-09-20 13:01:41,946 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,006 INFO L567 ElimStorePlain]: treesize reduction 48, result has 63.6 percent of original size [2019-09-20 13:01:42,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,026 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 33 treesize of output 39 [2019-09-20 13:01:42,027 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,047 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-09-20 13:01:42,048 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:130, output treesize:87 [2019-09-20 13:01:42,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:42,230 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 17 treesize of output 7 [2019-09-20 13:01:42,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,249 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-09-20 13:01:42,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:107, output treesize:91 [2019-09-20 13:01:42,454 INFO L341 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-09-20 13:01:42,455 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 132 treesize of output 143 [2019-09-20 13:01:42,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:42,508 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:42,554 INFO L567 ElimStorePlain]: treesize reduction 97, result has 34.9 percent of original size [2019-09-20 13:01:42,566 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2019-09-20 13:01:42,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:42,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:42,577 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:7 [2019-09-20 13:01:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:42,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:42,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-09-20 13:01:42,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-20 13:01:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-20 13:01:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:01:42,595 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 18 states. [2019-09-20 13:01:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:44,068 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2019-09-20 13:01:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:01:44,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-09-20 13:01:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:44,069 INFO L225 Difference]: With dead ends: 108 [2019-09-20 13:01:44,070 INFO L226 Difference]: Without dead ends: 82 [2019-09-20 13:01:44,070 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-09-20 13:01:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-20 13:01:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2019-09-20 13:01:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-20 13:01:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-09-20 13:01:44,080 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 25 [2019-09-20 13:01:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:44,081 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-09-20 13:01:44,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-20 13:01:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-09-20 13:01:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:01:44,082 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:44,082 INFO L407 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] [2019-09-20 13:01:44,082 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash -986080041, now seen corresponding path program 1 times [2019-09-20 13:01:44,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:44,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:44,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:44,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:44,297 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:44,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:44,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-20 13:01:44,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:44,428 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:44,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,445 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-09-20 13:01:44,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-09-20 13:01:44,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,490 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-09-20 13:01:44,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,520 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_38|], 2=[|v_#memory_$Pointer$.base_37|, |v_#memory_int_28|], 4=[|v_#memory_int_26|]} [2019-09-20 13:01:44,534 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 35 treesize of output 7 [2019-09-20 13:01:44,534 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,559 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 19 treesize of output 18 [2019-09-20 13:01:44,559 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:44,587 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 25 treesize of output 13 [2019-09-20 13:01:44,588 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:44,607 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 30 treesize of output 22 [2019-09-20 13:01:44,608 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:44,620 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:101, output treesize:42 [2019-09-20 13:01:44,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,710 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 40 treesize of output 35 [2019-09-20 13:01:44,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,729 INFO L567 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size [2019-09-20 13:01:44,730 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-09-20 13:01:44,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:23 [2019-09-20 13:01:44,757 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_int_27|], 6=[|v_#memory_int_29|]} [2019-09-20 13:01:44,759 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:44,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,800 INFO L341 Elim1Store]: treesize reduction 69, result has 31.7 percent of original size [2019-09-20 13:01:44,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2019-09-20 13:01:44,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:44,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:44,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:44,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:44,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:45 [2019-09-20 13:01:44,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:44,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:46,916 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-09-20 13:01:46,921 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 28 treesize of output 10 [2019-09-20 13:01:46,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:46,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:46,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:46,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-09-20 13:01:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:46,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:46,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-20 13:01:46,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:01:46,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:01:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:01:46,936 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 15 states. [2019-09-20 13:01:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:47,840 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2019-09-20 13:01:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-20 13:01:47,840 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-09-20 13:01:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:47,858 INFO L225 Difference]: With dead ends: 112 [2019-09-20 13:01:47,859 INFO L226 Difference]: Without dead ends: 103 [2019-09-20 13:01:47,859 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2019-09-20 13:01:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-20 13:01:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2019-09-20 13:01:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-20 13:01:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-09-20 13:01:47,878 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 25 [2019-09-20 13:01:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:47,879 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-09-20 13:01:47,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:01:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-09-20 13:01:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:01:47,880 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:47,880 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:47,880 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash -421093171, now seen corresponding path program 1 times [2019-09-20 13:01:47,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:47,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:47,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:48,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:48,183 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:48,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:48,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-20 13:01:48,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:48,310 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:48,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:48,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,358 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-09-20 13:01:48,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,497 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-20 13:01:48,498 INFO L567 ElimStorePlain]: treesize reduction 14, result has 90.5 percent of original size [2019-09-20 13:01:48,500 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_42|, |v_#memory_int_30|], 2=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_39|]} [2019-09-20 13:01:48,516 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 35 treesize of output 7 [2019-09-20 13:01:48,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,568 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 35 treesize of output 7 [2019-09-20 13:01:48,568 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:48,604 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 20 treesize of output 9 [2019-09-20 13:01:48,605 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,635 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 19 treesize of output 18 [2019-09-20 13:01:48,636 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,664 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 19 treesize of output 18 [2019-09-20 13:01:48,664 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,687 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:135, output treesize:58 [2019-09-20 13:01:48,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,796 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-09-20 13:01:48,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:48,983 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-20 13:01:48,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:48,986 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_40|], 2=[|v_#memory_int_33|], 4=[|v_#memory_int_31|], 10=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2019-09-20 13:01:48,992 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:49,126 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-09-20 13:01:49,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,131 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:49,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-09-20 13:01:49,243 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,310 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 36 treesize of output 28 [2019-09-20 13:01:49,310 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,389 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 172 treesize of output 153 [2019-09-20 13:01:49,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:49,394 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,550 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-20 13:01:49,551 INFO L567 ElimStorePlain]: treesize reduction 466, result has 23.9 percent of original size [2019-09-20 13:01:49,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,599 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 2 case distinctions, treesize of input 117 treesize of output 122 [2019-09-20 13:01:49,600 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,664 INFO L567 ElimStorePlain]: treesize reduction 32, result has 74.0 percent of original size [2019-09-20 13:01:49,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,665 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:270, output treesize:106 [2019-09-20 13:01:49,758 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_39|, |v_#memory_$Pointer$.base_41|], 4=[|v_#memory_int_32|], 5=[|v_#memory_int_34|, |v_#memory_$Pointer$.base_44|, |v_#memory_$Pointer$.offset_42|]} [2019-09-20 13:01:49,765 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 15 treesize of output 11 [2019-09-20 13:01:49,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,821 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 15 treesize of output 11 [2019-09-20 13:01:49,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:49,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,875 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:49,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:49,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:49,952 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 50 treesize of output 42 [2019-09-20 13:01:49,953 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,022 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.2 percent of original size [2019-09-20 13:01:50,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,049 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 95 treesize of output 73 [2019-09-20 13:01:50,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:50,057 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,116 INFO L567 ElimStorePlain]: treesize reduction 40, result has 65.2 percent of original size [2019-09-20 13:01:50,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:50,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:50,125 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 37 treesize of output 17 [2019-09-20 13:01:50,125 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:50,141 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:171, output treesize:46 [2019-09-20 13:01:50,284 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-09-20 13:01:50,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,302 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-09-20 13:01:50,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,313 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-09-20 13:01:50,314 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-09-20 13:01:50,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:50,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 29 [2019-09-20 13:01:50,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,371 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-09-20 13:01:50,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:50,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-09-20 13:01:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:50,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:50,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-20 13:01:50,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-20 13:01:50,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-20 13:01:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:01:50,400 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 17 states. [2019-09-20 13:01:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:52,025 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2019-09-20 13:01:52,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:01:52,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-09-20 13:01:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:52,027 INFO L225 Difference]: With dead ends: 118 [2019-09-20 13:01:52,027 INFO L226 Difference]: Without dead ends: 116 [2019-09-20 13:01:52,028 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-09-20 13:01:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-20 13:01:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2019-09-20 13:01:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-20 13:01:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2019-09-20 13:01:52,039 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 25 [2019-09-20 13:01:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:52,040 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2019-09-20 13:01:52,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-20 13:01:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2019-09-20 13:01:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:01:52,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:52,041 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:52,041 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:52,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1489624486, now seen corresponding path program 3 times [2019-09-20 13:01:52,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:52,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:52,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:52,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:52,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:52,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:52,297 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:52,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:01:52,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 13:01:52,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:52,436 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-20 13:01:52,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:52,443 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:52,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:52,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:52,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:52,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:52,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:52,488 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-09-20 13:01:52,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:52,597 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-20 13:01:52,598 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.0 percent of original size [2019-09-20 13:01:52,599 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_46|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-09-20 13:01:52,618 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 35 treesize of output 7 [2019-09-20 13:01:52,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:52,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:52,680 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 35 treesize of output 7 [2019-09-20 13:01:52,680 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:52,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:52,707 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 19 treesize of output 18 [2019-09-20 13:01:52,708 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:52,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:52,734 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 19 treesize of output 18 [2019-09-20 13:01:52,735 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:52,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:52,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:52,755 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:115, output treesize:49 [2019-09-20 13:01:52,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:52,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-09-20 13:01:52,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,208 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-20 13:01:53,209 INFO L567 ElimStorePlain]: treesize reduction 40, result has 83.7 percent of original size [2019-09-20 13:01:53,210 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_44|, |v_#memory_int_35|], 7=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_47|]} [2019-09-20 13:01:53,219 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:53,330 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-20 13:01:53,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,336 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:53,455 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-20 13:01:53,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,465 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 18 treesize of output 7 [2019-09-20 13:01:53,466 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,569 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-20 13:01:53,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,606 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 140 treesize of output 125 [2019-09-20 13:01:53,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:53,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:53,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:53,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:53,612 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,866 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-09-20 13:01:53,867 INFO L567 ElimStorePlain]: treesize reduction 322, result has 29.1 percent of original size [2019-09-20 13:01:53,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:53,876 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 93 treesize of output 67 [2019-09-20 13:01:53,876 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:53,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:53,922 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-09-20 13:01:53,922 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:200, output treesize:122 [2019-09-20 13:01:54,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:54,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:54,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-09-20 13:01:54,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:54,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:54,112 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|], 1=[|v_#memory_int_36|], 3=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_50|]} [2019-09-20 13:01:54,115 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:54,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:54,179 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:54,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:54,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2019-09-20 13:01:54,234 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:54,309 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.2 percent of original size [2019-09-20 13:01:54,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:54,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:54,318 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 0 case distinctions, treesize of input 48 treesize of output 57 [2019-09-20 13:01:54,319 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:54,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:54,387 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:54,388 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 5 case distinctions, treesize of input 107 treesize of output 134 [2019-09-20 13:01:54,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:54,401 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:54,479 INFO L567 ElimStorePlain]: treesize reduction 96, result has 51.3 percent of original size [2019-09-20 13:01:54,480 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-09-20 13:01:54,480 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:197, output treesize:145 [2019-09-20 13:01:55,081 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-20 13:01:55,081 INFO L341 Elim1Store]: treesize reduction 24, result has 82.9 percent of original size [2019-09-20 13:01:55,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 210 [2019-09-20 13:01:55,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,485 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:55,614 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-09-20 13:01:55,614 INFO L567 ElimStorePlain]: treesize reduction 137, result has 39.9 percent of original size [2019-09-20 13:01:55,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:55,660 INFO L341 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2019-09-20 13:01:55,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 56 [2019-09-20 13:01:55,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:55,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:55,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:55,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:222, output treesize:30 [2019-09-20 13:01:55,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:55,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 30 [2019-09-20 13:01:55,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:55,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:55,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:55,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:55,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-09-20 13:01:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:55,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:55,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2019-09-20 13:01:55,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-20 13:01:55,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-20 13:01:55,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:01:55,853 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 22 states. [2019-09-20 13:01:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:58,503 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2019-09-20 13:01:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:01:58,504 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2019-09-20 13:01:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:58,506 INFO L225 Difference]: With dead ends: 137 [2019-09-20 13:01:58,506 INFO L226 Difference]: Without dead ends: 135 [2019-09-20 13:01:58,507 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2019-09-20 13:01:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-20 13:01:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 92. [2019-09-20 13:01:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-20 13:01:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2019-09-20 13:01:58,520 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 27 [2019-09-20 13:01:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:58,520 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2019-09-20 13:01:58,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-20 13:01:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2019-09-20 13:01:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:01:58,522 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:58,522 INFO L407 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, 1] [2019-09-20 13:01:58,522 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1119694038, now seen corresponding path program 2 times [2019-09-20 13:01:58,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:58,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:58,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:58,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:58,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:58,665 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:58,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:01:58,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:01:58,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:58,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-20 13:01:58,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:58,830 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:01:58,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-20 13:01:58,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,885 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-09-20 13:01:58,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:58,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,932 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:58,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,963 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:58,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:58,987 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 30 treesize of output 22 [2019-09-20 13:01:58,988 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,009 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 30 treesize of output 22 [2019-09-20 13:01:59,009 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,024 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-09-20 13:01:59,024 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:98, output treesize:41 [2019-09-20 13:01:59,113 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-20 13:01:59,113 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 43 [2019-09-20 13:01:59,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:59,118 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:59,136 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-09-20 13:01:59,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,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, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-09-20 13:01:59,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:59,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:59,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:7 [2019-09-20 13:01:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:59,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:59,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-20 13:01:59,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:01:59,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:01:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:01:59,179 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 12 states. [2019-09-20 13:01:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:59,885 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2019-09-20 13:01:59,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:01:59,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-20 13:01:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:59,887 INFO L225 Difference]: With dead ends: 123 [2019-09-20 13:01:59,887 INFO L226 Difference]: Without dead ends: 93 [2019-09-20 13:01:59,888 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:01:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-20 13:01:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-09-20 13:01:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-20 13:01:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-09-20 13:01:59,899 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 28 [2019-09-20 13:01:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:59,900 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-09-20 13:01:59,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:01:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-09-20 13:01:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:01:59,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:59,901 INFO L407 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, 1, 1] [2019-09-20 13:01:59,901 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash -809428639, now seen corresponding path program 1 times [2019-09-20 13:01:59,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:59,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:59,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:59,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:00,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:00,235 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:00,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:00,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-20 13:02:00,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:00,426 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:00,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-20 13:02:00,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,481 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-09-20 13:02:00,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,513 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_53|, |v_#memory_$Pointer$.base_55|], 2=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_53|]} [2019-09-20 13:02:00,527 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 35 treesize of output 7 [2019-09-20 13:02:00,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,556 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 35 treesize of output 7 [2019-09-20 13:02:00,556 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,571 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 19 treesize of output 18 [2019-09-20 13:02:00,572 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,585 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 19 treesize of output 18 [2019-09-20 13:02:00,586 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:00,595 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:103, output treesize:38 [2019-09-20 13:02:00,698 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_$Pointer$.offset_52|, |v_#memory_$Pointer$.base_54|], 10=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_54|]} [2019-09-20 13:02:00,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,718 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 44 treesize of output 17 [2019-09-20 13:02:00,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:00,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,764 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:00,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,800 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:00,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:00,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:00,996 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-20 13:02:00,996 INFO L341 Elim1Store]: treesize reduction 62, result has 70.0 percent of original size [2019-09-20 13:02:00,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 230 [2019-09-20 13:02:00,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:01,000 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,090 INFO L567 ElimStorePlain]: treesize reduction 112, result has 56.1 percent of original size [2019-09-20 13:02:01,212 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-20 13:02:01,213 INFO L341 Elim1Store]: treesize reduction 19, result has 77.6 percent of original size [2019-09-20 13:02:01,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 155 [2019-09-20 13:02:01,215 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,307 INFO L567 ElimStorePlain]: treesize reduction 16, result has 87.0 percent of original size [2019-09-20 13:02:01,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:01,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:01,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,309 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:220, output treesize:27 [2019-09-20 13:02:01,370 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-09-20 13:02:01,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,383 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-09-20 13:02:01,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-09-20 13:02:01,403 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-09-20 13:02:01,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:01,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:01,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:02:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:01,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:01,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-20 13:02:01,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-20 13:02:01,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-20 13:02:01,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:02:01,439 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 17 states. [2019-09-20 13:02:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:02,429 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2019-09-20 13:02:02,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-20 13:02:02,430 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-09-20 13:02:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:02,431 INFO L225 Difference]: With dead ends: 130 [2019-09-20 13:02:02,431 INFO L226 Difference]: Without dead ends: 109 [2019-09-20 13:02:02,432 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2019-09-20 13:02:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-20 13:02:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2019-09-20 13:02:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-20 13:02:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-09-20 13:02:02,447 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 29 [2019-09-20 13:02:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:02,447 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-09-20 13:02:02,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-20 13:02:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2019-09-20 13:02:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:02:02,449 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:02,449 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:02,450 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash -467982571, now seen corresponding path program 4 times [2019-09-20 13:02:02,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:02,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:02,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:02,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:02,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:02,935 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:03,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:02:03,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:02:03,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:03,077 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-20 13:02:03,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:03,091 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:03,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,103 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-09-20 13:02:03,103 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-09-20 13:02:03,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,173 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-09-20 13:02:03,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,509 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-20 13:02:03,509 INFO L567 ElimStorePlain]: treesize reduction 14, result has 91.8 percent of original size [2019-09-20 13:02:03,511 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_59|, |v_#memory_$Pointer$.base_61|], 2=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_55|, |v_#memory_int_42|], 4=[|v_#memory_int_39|]} [2019-09-20 13:02:03,535 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 35 treesize of output 7 [2019-09-20 13:02:03,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,621 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 35 treesize of output 7 [2019-09-20 13:02:03,621 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,675 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 19 treesize of output 18 [2019-09-20 13:02:03,675 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,721 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 19 treesize of output 18 [2019-09-20 13:02:03,722 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,764 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 25 treesize of output 13 [2019-09-20 13:02:03,765 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:03,795 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 30 treesize of output 22 [2019-09-20 13:02:03,796 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:03,817 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:159, output treesize:67 [2019-09-20 13:02:03,950 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:03,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-09-20 13:02:03,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:04,598 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-20 13:02:04,598 INFO L567 ElimStorePlain]: treesize reduction 40, result has 86.9 percent of original size [2019-09-20 13:02:04,602 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_56|], 4=[|v_#memory_int_40|, |v_#memory_int_43|], 9=[|v_#memory_$Pointer$.offset_60|, |v_#memory_$Pointer$.base_62|]} [2019-09-20 13:02:04,608 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:04,797 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-20 13:02:04,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:04,803 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:04,998 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-20 13:02:04,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,004 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:05,214 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-20 13:02:05,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,228 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 73 treesize of output 47 [2019-09-20 13:02:05,229 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,334 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 67 treesize of output 41 [2019-09-20 13:02:05,335 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,462 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 118 treesize of output 111 [2019-09-20 13:02:05,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:05,466 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,585 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-09-20 13:02:05,585 INFO L567 ElimStorePlain]: treesize reduction 134, result has 51.1 percent of original size [2019-09-20 13:02:05,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:05,586 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:260, output treesize:110 [2019-09-20 13:02:05,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:05,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:05,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-09-20 13:02:05,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:06,472 WARN L191 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-09-20 13:02:06,473 INFO L567 ElimStorePlain]: treesize reduction 78, result has 82.8 percent of original size [2019-09-20 13:02:06,475 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_57|], 1=[|v_#memory_int_41|], 7=[|v_#memory_int_44|], 11=[|v_#memory_$Pointer$.base_63|, |v_#memory_$Pointer$.offset_61|]} [2019-09-20 13:02:06,487 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:06,732 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-20 13:02:06,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,736 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:06,928 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-09-20 13:02:06,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:06,933 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:07,174 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-09-20 13:02:07,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:07,189 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 0 case distinctions, treesize of input 102 treesize of output 67 [2019-09-20 13:02:07,190 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,324 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-09-20 13:02:07,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,448 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-20 13:02:07,448 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-09-20 13:02:07,449 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 277 treesize of output 211 [2019-09-20 13:02:07,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:07,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:07,478 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:07,821 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 74 [2019-09-20 13:02:07,822 INFO L567 ElimStorePlain]: treesize reduction 1329, result has 15.4 percent of original size [2019-09-20 13:02:07,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:07,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:07,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:07,831 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 0 case distinctions, treesize of input 194 treesize of output 155 [2019-09-20 13:02:07,832 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:07,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:07,898 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:358, output treesize:233 [2019-09-20 13:02:08,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 72 [2019-09-20 13:02:08,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,142 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-09-20 13:02:08,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,144 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_58|, |v_#memory_$Pointer$.base_60|], 6=[|v_#memory_$Pointer$.base_64|, |v_#memory_$Pointer$.offset_62|], 10=[|v_#memory_int_45|]} [2019-09-20 13:02:08,148 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:08,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,241 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:08,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,392 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 220 treesize of output 217 [2019-09-20 13:02:08,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:08,481 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:08,721 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2019-09-20 13:02:08,721 INFO L567 ElimStorePlain]: treesize reduction 148, result has 51.8 percent of original size [2019-09-20 13:02:08,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2019-09-20 13:02:08,737 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:08,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:08,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2019-09-20 13:02:08,822 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:08,931 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-20 13:02:08,932 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.3 percent of original size [2019-09-20 13:02:08,933 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-09-20 13:02:08,933 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:306, output treesize:261 [2019-09-20 13:02:09,811 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-09-20 13:02:09,811 INFO L341 Elim1Store]: treesize reduction 32, result has 83.3 percent of original size [2019-09-20 13:02:09,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 322 treesize of output 279 [2019-09-20 13:02:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:09,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:10,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms