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/heap-data/shared_mem1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:14:20,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:14:20,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:14:20,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:14:20,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:14:20,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:14:20,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:14:20,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:14:20,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:14:20,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:14:20,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:14:20,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:14:20,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:14:20,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:14:20,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:14:20,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:14:20,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:14:20,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:14:20,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:14:20,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:14:20,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:14:20,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:14:20,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:14:20,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:14:20,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:14:20,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:14:20,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:14:20,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:14:20,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:14:20,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:14:20,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:14:20,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:14:20,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:14:20,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:14:20,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:14:20,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:14:20,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:14:20,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:14:20,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:14:20,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:14:20,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:14:20,347 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-08 02:14:20,360 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:14:20,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:14:20,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:14:20,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:14:20,365 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:14:20,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:14:20,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:14:20,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:14:20,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:14:20,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:14:20,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:14:20,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:14:20,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:14:20,369 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:14:20,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:14:20,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:14:20,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:14:20,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:14:20,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:14:20,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:14:20,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:14:20,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:14:20,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:14:20,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:14:20,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:14:20,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:14:20,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:14:20,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:14:20,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:14:20,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:14:20,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:14:20,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:14:20,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:14:20,420 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:14:20,421 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem1.i [2019-09-08 02:14:20,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88e4d412/c4d42c4cbc2745a1bd78200e3d9c8e18/FLAG6241efdf2 [2019-09-08 02:14:20,972 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:14:20,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i [2019-09-08 02:14:20,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88e4d412/c4d42c4cbc2745a1bd78200e3d9c8e18/FLAG6241efdf2 [2019-09-08 02:14:21,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88e4d412/c4d42c4cbc2745a1bd78200e3d9c8e18 [2019-09-08 02:14:21,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:14:21,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:14:21,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:14:21,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:14:21,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:14:21,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:21,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1514fdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21, skipping insertion in model container [2019-09-08 02:14:21,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:21,313 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:14:21,371 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:14:21,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:14:21,829 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:14:21,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:14:21,941 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:14:21,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21 WrapperNode [2019-09-08 02:14:21,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:14:21,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:14:21,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:14:21,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:14:21,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:21,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:21,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:21,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:21,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:21,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:21,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (1/1) ... [2019-09-08 02:14:22,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:14:22,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:14:22,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:14:22,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:14:22,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (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-08 02:14:22,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:14:22,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:14:22,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 02:14:22,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 02:14:22,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:14:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:14:22,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:14:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 02:14:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 02:14:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 02:14:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 02:14:22,056 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 02:14:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 02:14:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 02:14:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 02:14:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 02:14:22,057 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 02:14:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 02:14:22,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 02:14:22,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 02:14:22,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 02:14:22,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 02:14:22,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 02:14:22,060 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 02:14:22,060 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 02:14:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 02:14:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 02:14:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 02:14:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 02:14:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 02:14:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 02:14:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 02:14:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 02:14:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 02:14:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 02:14:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 02:14:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 02:14:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 02:14:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 02:14:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 02:14:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 02:14:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 02:14:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 02:14:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 02:14:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 02:14:22,067 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 02:14:22,067 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 02:14:22,067 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 02:14:22,067 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 02:14:22,067 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 02:14:22,068 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 02:14:22,068 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 02:14:22,068 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 02:14:22,068 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 02:14:22,068 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 02:14:22,068 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 02:14:22,068 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 02:14:22,069 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 02:14:22,069 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 02:14:22,070 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 02:14:22,071 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 02:14:22,071 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 02:14:22,071 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 02:14:22,071 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 02:14:22,071 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 02:14:22,072 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 02:14:22,072 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 02:14:22,072 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 02:14:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 02:14:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 02:14:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 02:14:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 02:14:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 02:14:22,074 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 02:14:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 02:14:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 02:14:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 02:14:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 02:14:22,076 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 02:14:22,076 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 02:14:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 02:14:22,077 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 02:14:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 02:14:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 02:14:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 02:14:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 02:14:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 02:14:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 02:14:22,078 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 02:14:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 02:14:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 02:14:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 02:14:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 02:14:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 02:14:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 02:14:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 02:14:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 02:14:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 02:14:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 02:14:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 02:14:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 02:14:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 02:14:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 02:14:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 02:14:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 02:14:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 02:14:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 02:14:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 02:14:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 02:14:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 02:14:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 02:14:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 02:14:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:14:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 02:14:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:14:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 02:14:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 02:14:22,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:14:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:14:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:14:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:14:22,619 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:14:22,619 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 02:14:22,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:14:22 BoogieIcfgContainer [2019-09-08 02:14:22,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:14:22,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:14:22,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:14:22,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:14:22,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:14:21" (1/3) ... [2019-09-08 02:14:22,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238d27b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:14:22, skipping insertion in model container [2019-09-08 02:14:22,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:21" (2/3) ... [2019-09-08 02:14:22,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238d27b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:14:22, skipping insertion in model container [2019-09-08 02:14:22,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:14:22" (3/3) ... [2019-09-08 02:14:22,629 INFO L109 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2019-09-08 02:14:22,640 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:14:22,650 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:14:22,667 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:14:22,700 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:14:22,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:14:22,700 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:14:22,701 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:14:22,701 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:14:22,701 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:14:22,701 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:14:22,701 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:14:22,702 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:14:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-08 02:14:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:14:22,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:22,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:22,722 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:22,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash -53964180, now seen corresponding path program 1 times [2019-09-08 02:14:22,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:22,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:22,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:22,888 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-08 02:14:22,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:14:22,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:14:22,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:14:22,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:14:22,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:14:22,912 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-09-08 02:14:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:22,930 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-09-08 02:14:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:14:22,931 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-08 02:14:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:22,939 INFO L225 Difference]: With dead ends: 33 [2019-09-08 02:14:22,939 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 02:14:22,943 INFO L628 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-08 02:14:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 02:14:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 02:14:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 02:14:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-09-08 02:14:22,978 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 14 [2019-09-08 02:14:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:22,979 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-09-08 02:14:22,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:14:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-09-08 02:14:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:14:22,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:22,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:22,981 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:22,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:22,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1423019225, now seen corresponding path program 1 times [2019-09-08 02:14:22,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:22,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:23,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:14:23,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 02:14:23,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:14:23,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:14:23,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:14:23,355 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-09-08 02:14:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:23,686 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-09-08 02:14:23,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:14:23,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-09-08 02:14:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:23,689 INFO L225 Difference]: With dead ends: 33 [2019-09-08 02:14:23,690 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:14:23,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:14:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:14:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-09-08 02:14:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:14:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-09-08 02:14:23,708 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-09-08 02:14:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:23,708 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-09-08 02:14:23,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:14:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-09-08 02:14:23,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:14:23,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:23,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:23,711 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1423021147, now seen corresponding path program 1 times [2019-09-08 02:14:23,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:23,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:23,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:23,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:23,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:24,008 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-08 02:14:24,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:14:24,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 02:14:24,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:14:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:14:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:14:24,010 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 7 states. [2019-09-08 02:14:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:24,260 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-09-08 02:14:24,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:14:24,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-09-08 02:14:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:24,262 INFO L225 Difference]: With dead ends: 35 [2019-09-08 02:14:24,262 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 02:14:24,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:14:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 02:14:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-09-08 02:14:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:14:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-09-08 02:14:24,275 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2019-09-08 02:14:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:24,275 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-09-08 02:14:24,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:14:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-09-08 02:14:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:14:24,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:24,277 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:24,277 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash -442037965, now seen corresponding path program 1 times [2019-09-08 02:14:24,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:24,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:24,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:24,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:24,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:24,680 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-08 02:14:24,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:14:24,681 INFO L223 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-08 02:14:24,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:24,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 02:14:24,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:14:24,863 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-08 02:14:24,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-09-08 02:14:24,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:24,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:24,938 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_26|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_22|], 2=[|v_#memory_int_23|]} [2019-09-08 02:14:24,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:25,015 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-09-08 02:14:25,016 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 1 case distinctions, treesize of input 38 treesize of output 48 [2019-09-08 02:14:25,017 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:25,129 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 02:14:25,129 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.9 percent of original size [2019-09-08 02:14:25,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:25,142 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 18 treesize of output 19 [2019-09-08 02:14:25,142 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:25,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:25,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:25,217 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 18 treesize of output 19 [2019-09-08 02:14:25,217 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:25,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:25,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:25,324 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-09-08 02:14:25,325 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 51 treesize of output 60 [2019-09-08 02:14:25,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:25,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:25,334 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:25,426 INFO L567 ElimStorePlain]: treesize reduction 55, result has 63.8 percent of original size [2019-09-08 02:14:25,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:25,428 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:112, output treesize:96 [2019-09-08 02:14:25,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:14:25,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:25,598 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 239 treesize of output 243 [2019-09-08 02:14:25,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:25,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:25,645 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 241 treesize of output 245 [2019-09-08 02:14:25,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:25,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:25,697 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 241 treesize of output 245 [2019-09-08 02:14:25,698 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:25,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:25,740 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 240 treesize of output 244 [2019-09-08 02:14:25,741 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:26,860 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 98 [2019-09-08 02:14:26,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:26,865 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|, |v_#memory_int_25|], 6=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.offset_23|], 10=[|v_#memory_int_27|]} [2019-09-08 02:14:26,881 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-08 02:14:26,909 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-08 02:14:26,925 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:26,936 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:28,677 WARN L188 SmtUtils]: Spent 1.74 s on a formula simplification that was a NOOP. DAG size: 116 [2019-09-08 02:14:28,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:28,688 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:28,721 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:28,734 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:28,750 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:30,036 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 118 [2019-09-08 02:14:30,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:30,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:30,141 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 220 [2019-09-08 02:14:30,142 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:30,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:30,232 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 221 [2019-09-08 02:14:30,233 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:30,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:30,308 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 221 [2019-09-08 02:14:30,309 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:30,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:30,368 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2019-09-08 02:14:30,369 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:31,420 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 112 [2019-09-08 02:14:31,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:31,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:31,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:31,586 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 194 [2019-09-08 02:14:31,587 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:31,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:31,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:31,779 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 196 [2019-09-08 02:14:31,780 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:31,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:31,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:31,991 INFO L235 Elim1Store]: Index analysis took 174 ms [2019-09-08 02:14:32,111 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 195 [2019-09-08 02:14:32,112 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:32,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:32,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:32,166 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 196 [2019-09-08 02:14:32,167 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:32,959 WARN L188 SmtUtils]: Spent 792.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-09-08 02:14:32,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:32,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:33,002 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 181 [2019-09-08 02:14:33,003 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:33,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:33,054 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 181 [2019-09-08 02:14:33,055 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:33,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:33,138 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 179 [2019-09-08 02:14:33,139 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:33,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:33,182 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 180 [2019-09-08 02:14:33,183 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:34,115 WARN L188 SmtUtils]: Spent 931.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-08 02:14:34,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:34,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,259 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 175 treesize of output 156 [2019-09-08 02:14:34,260 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:34,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,449 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 155 [2019-09-08 02:14:34,450 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:34,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,570 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 175 treesize of output 156 [2019-09-08 02:14:34,571 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:34,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:34,649 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 154 [2019-09-08 02:14:34,650 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:35,124 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-09-08 02:14:35,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:35,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 123 [2019-09-08 02:14:35,184 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:35,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,434 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 02:14:35,435 INFO L341 Elim1Store]: treesize reduction 51, result has 72.4 percent of original size [2019-09-08 02:14:35,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 251 [2019-09-08 02:14:35,437 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:35,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 123 [2019-09-08 02:14:35,468 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:35,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:35,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 121 [2019-09-08 02:14:35,516 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:36,022 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-08 02:14:36,022 INFO L567 ElimStorePlain]: treesize reduction 95, result has 84.4 percent of original size [2019-09-08 02:14:36,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-09-08 02:14:36,027 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 11 variables, input treesize:962, output treesize:593 [2019-09-08 02:14:36,406 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-08 02:14:36,594 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-08 02:14:36,776 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-08 02:14:36,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:36,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:14:36,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:14:36,820 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_28|, v_prenex_3], 10=[v_prenex_1, v_prenex_2], 12=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|], 39=[v_prenex_6], 46=[v_prenex_4, v_prenex_5]} [2019-09-08 02:14:36,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:36,830 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 0 case distinctions, treesize of input 181 treesize of output 146 [2019-09-08 02:14:36,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:37,549 WARN L188 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 162 [2019-09-08 02:14:37,550 INFO L567 ElimStorePlain]: treesize reduction 30, result has 97.3 percent of original size [2019-09-08 02:14:37,561 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:14:37,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 114 [2019-09-08 02:14:37,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:37,884 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-09-08 02:14:37,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:37,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:37,935 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:37,935 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 5 case distinctions, treesize of input 109 treesize of output 136 [2019-09-08 02:14:37,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:37,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:37,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:37,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:37,940 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-08 02:14:38,560 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 146 [2019-09-08 02:14:38,560 INFO L567 ElimStorePlain]: treesize reduction 36, result has 96.6 percent of original size [2019-09-08 02:14:38,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:38,597 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2019-09-08 02:14:38,600 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:38,899 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-09-08 02:14:38,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:38,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:38,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:38,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:38,964 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 5 case distinctions, treesize of input 146 treesize of output 171 [2019-09-08 02:14:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:38,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:38,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:38,970 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-08 02:14:39,548 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 124 [2019-09-08 02:14:39,549 INFO L567 ElimStorePlain]: treesize reduction 44, result has 95.3 percent of original size [2019-09-08 02:14:39,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:39,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:39,563 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 61 [2019-09-08 02:14:39,574 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:39,840 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-09-08 02:14:39,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:39,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:39,863 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 0 case distinctions, treesize of input 170 treesize of output 137 [2019-09-08 02:14:39,864 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:39,879 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:14:39,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:39,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 183 [2019-09-08 02:14:39,915 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:39,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:39,936 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 0 case distinctions, treesize of input 170 treesize of output 137 [2019-09-08 02:14:39,938 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:39,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:39,958 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 0 case distinctions, treesize of input 168 treesize of output 135 [2019-09-08 02:14:39,959 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:39,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:39,971 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 0 case distinctions, treesize of input 157 treesize of output 124 [2019-09-08 02:14:39,972 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:40,630 WARN L188 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-09-08 02:14:40,631 INFO L567 ElimStorePlain]: treesize reduction 86, result has 89.1 percent of original size [2019-09-08 02:14:40,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:40,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:40,693 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 4 case distinctions, treesize of input 135 treesize of output 158 [2019-09-08 02:14:40,695 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:40,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:40,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:40,772 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 4 case distinctions, treesize of input 133 treesize of output 156 [2019-09-08 02:14:40,773 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:40,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:40,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:40,823 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 4 case distinctions, treesize of input 127 treesize of output 150 [2019-09-08 02:14:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,837 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:40,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:40,891 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:40,891 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 4 case distinctions, treesize of input 135 treesize of output 158 [2019-09-08 02:14:40,895 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:40,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:40,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:40,932 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 5 case distinctions, treesize of input 122 treesize of output 149 [2019-09-08 02:14:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:40,935 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:41,155 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-09-08 02:14:41,156 INFO L567 ElimStorePlain]: treesize reduction 198, result has 66.3 percent of original size [2019-09-08 02:14:41,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:41,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2019-09-08 02:14:41,170 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:41,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:41,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2019-09-08 02:14:41,187 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:41,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:41,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2019-09-08 02:14:41,205 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:41,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:41,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2019-09-08 02:14:41,223 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:41,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:41,231 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 57 [2019-09-08 02:14:41,232 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:41,310 INFO L567 ElimStorePlain]: treesize reduction 35, result has 78.3 percent of original size [2019-09-08 02:14:41,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 9 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-09-08 02:14:41,312 INFO L221 ElimStorePlain]: Needed 22 recursive calls to eliminate 10 variables, input treesize:1165, output treesize:110 [2019-09-08 02:14:41,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:14:41,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:41,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:41,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:41,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:41,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:41,421 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-08 02:14:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:14:41,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-08 02:14:41,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:14:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:14:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:14:41,427 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 14 states. [2019-09-08 02:14:41,787 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 56 [2019-09-08 02:14:42,362 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 60 [2019-09-08 02:14:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:42,439 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-09-08 02:14:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:14:42,440 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-09-08 02:14:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:42,441 INFO L225 Difference]: With dead ends: 46 [2019-09-08 02:14:42,441 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 02:14:42,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:14:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 02:14:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-09-08 02:14:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:14:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-08 02:14:42,449 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2019-09-08 02:14:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:42,450 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-08 02:14:42,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:14:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-08 02:14:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:14:42,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:42,451 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:42,453 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash -442036043, now seen corresponding path program 1 times [2019-09-08 02:14:42,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:42,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:42,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:42,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:42,731 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-08 02:14:42,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:14:42,732 INFO L223 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-08 02:14:42,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:42,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:14:42,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:14:42,871 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-08 02:14:42,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:14:42,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:42,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:42,965 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|, |v_#memory_int_32|], 2=[|v_#memory_int_29|]} [2019-09-08 02:14:42,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:42,978 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 19 [2019-09-08 02:14:42,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:43,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:43,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:43,064 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 19 [2019-09-08 02:14:43,064 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:43,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:43,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:43,139 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 38 treesize of output 15 [2019-09-08 02:14:43,140 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:43,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:43,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:43,189 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-08 02:14:43,189 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:43,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:43,225 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-08 02:14:43,226 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:120, output treesize:74 [2019-09-08 02:14:43,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:43,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-08 02:14:43,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:43,605 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-08 02:14:43,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:43,613 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_30|, |v_#memory_int_31|], 6=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.offset_27|], 10=[|v_#memory_int_33|]} [2019-09-08 02:14:43,624 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-08 02:14:43,821 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-09-08 02:14:43,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:43,828 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-08 02:14:43,982 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-08 02:14:43,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:44,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,036 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 34 treesize of output 25 [2019-09-08 02:14:44,037 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:44,164 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 02:14:44,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:44,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,179 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 62 treesize of output 43 [2019-09-08 02:14:44,180 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:44,315 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-08 02:14:44,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:44,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,339 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 34 treesize of output 25 [2019-09-08 02:14:44,340 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:44,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:44,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,449 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 62 treesize of output 43 [2019-09-08 02:14:44,450 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:44,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:44,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:44,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2019-09-08 02:14:44,521 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:44,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:44,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:14:44,571 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:249, output treesize:144 [2019-09-08 02:14:44,676 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_29|], 12=[|v_#memory_int_34|]} [2019-09-08 02:14:44,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:44,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 87 [2019-09-08 02:14:44,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,688 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-08 02:14:44,735 INFO L567 ElimStorePlain]: treesize reduction 10, result has 90.8 percent of original size [2019-09-08 02:14:44,801 INFO L341 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-09-08 02:14:44,802 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 5 case distinctions, treesize of input 81 treesize of output 94 [2019-09-08 02:14:44,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,810 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-08 02:14:44,845 INFO L567 ElimStorePlain]: treesize reduction 38, result has 55.8 percent of original size [2019-09-08 02:14:44,848 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-09-08 02:14:44,849 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:44,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:44,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:44,862 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:158, output treesize:19 [2019-09-08 02:14:44,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:44,893 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-08 02:14:44,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:14:44,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-08 02:14:44,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:14:44,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:14:44,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 02:14:44,900 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 12 states. [2019-09-08 02:14:45,172 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-08 02:14:45,547 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2019-09-08 02:14:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:45,620 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-09-08 02:14:45,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:14:45,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-08 02:14:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:45,624 INFO L225 Difference]: With dead ends: 39 [2019-09-08 02:14:45,624 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:14:45,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:14:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:14:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-09-08 02:14:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:14:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-08 02:14:45,630 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2019-09-08 02:14:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:45,631 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-08 02:14:45,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:14:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-08 02:14:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:14:45,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:45,632 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:45,632 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash 389431748, now seen corresponding path program 1 times [2019-09-08 02:14:45,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:45,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:45,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:45,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:45,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:14:45,913 INFO L223 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-08 02:14:45,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:45,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 02:14:45,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:14:45,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-08 02:14:45,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,037 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|, |v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 2=[|v_#memory_int_35|]} [2019-09-08 02:14:46,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:46,064 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 38 treesize of output 15 [2019-09-08 02:14:46,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:46,107 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 19 [2019-09-08 02:14:46,108 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:46,144 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 19 [2019-09-08 02:14:46,145 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:46,179 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-08 02:14:46,179 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,202 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-08 02:14:46,203 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:105, output treesize:58 [2019-09-08 02:14:46,280 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|], 20=[|v_#memory_int_37|]} [2019-09-08 02:14:46,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:14:46,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 172 treesize of output 219 [2019-09-08 02:14:46,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:46,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:46,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:46,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:46,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:46,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:46,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:46,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-09-08 02:14:46,508 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 02:14:46,509 INFO L567 ElimStorePlain]: treesize reduction 1421, result has 9.5 percent of original size [2019-09-08 02:14:46,513 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:14:46,514 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 115 [2019-09-08 02:14:46,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 35 [2019-09-08 02:14:46,537 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,552 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:60 [2019-09-08 02:14:46,633 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|#memory_int|]} [2019-09-08 02:14:46,646 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 52 treesize of output 36 [2019-09-08 02:14:46,647 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-08 02:14:46,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2019-09-08 02:14:46,658 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-08 02:14:46,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,673 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 12 [2019-09-08 02:14:46,673 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:46,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:14:46,677 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:66, output treesize:3 [2019-09-08 02:14:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:46,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:14:46,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-09-08 02:14:46,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:14:46,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:14:46,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:14:46,700 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 14 states. [2019-09-08 02:14:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:47,837 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2019-09-08 02:14:47,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:14:47,837 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-08 02:14:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:47,839 INFO L225 Difference]: With dead ends: 64 [2019-09-08 02:14:47,839 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 02:14:47,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-09-08 02:14:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 02:14:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2019-09-08 02:14:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:14:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-09-08 02:14:47,848 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-09-08 02:14:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:47,849 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-09-08 02:14:47,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:14:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-09-08 02:14:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:14:47,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:47,850 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:47,850 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:47,851 INFO L82 PathProgramCache]: Analyzing trace with hash 391280712, now seen corresponding path program 1 times [2019-09-08 02:14:47,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:47,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:47,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:47,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:47,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:48,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:14:48,418 INFO L223 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-08 02:14:48,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:48,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 02:14:48,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:14:48,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-08 02:14:48,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:48,513 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_39|, |v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_38|]} [2019-09-08 02:14:48,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:48,533 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 38 treesize of output 15 [2019-09-08 02:14:48,534 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:48,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:48,564 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 19 [2019-09-08 02:14:48,564 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:48,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:48,593 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 19 [2019-09-08 02:14:48,593 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:48,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:48,623 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-08 02:14:48,623 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:48,641 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-08 02:14:48,642 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:105, output treesize:58 [2019-09-08 02:14:48,709 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|], 20=[|v_#memory_int_40|]} [2019-09-08 02:14:48,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:14:48,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:48,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 121 [2019-09-08 02:14:48,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:48,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:14:48,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:48,789 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 180 [2019-09-08 02:14:48,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,848 INFO L567 ElimStorePlain]: treesize reduction 98, result has 47.0 percent of original size [2019-09-08 02:14:48,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2019-09-08 02:14:48,854 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:48,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:14:48,874 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:191, output treesize:66 [2019-09-08 02:14:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:49,043 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_34|], 12=[|v_#memory_int_41|]} [2019-09-08 02:14:49,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2019-09-08 02:14:49,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:49,080 INFO L567 ElimStorePlain]: treesize reduction 11, result has 87.1 percent of original size [2019-09-08 02:14:49,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2019-09-08 02:14:49,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:49,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:49,097 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 0 case distinctions, treesize of input 44 treesize of output 27 [2019-09-08 02:14:49,098 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:49,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:49,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:49,104 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:115, output treesize:19 [2019-09-08 02:14:49,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:49,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:14:49,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-09-08 02:14:49,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 02:14:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 02:14:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-08 02:14:49,147 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 16 states. [2019-09-08 02:14:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:49,757 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2019-09-08 02:14:49,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:14:49,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-09-08 02:14:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:49,759 INFO L225 Difference]: With dead ends: 66 [2019-09-08 02:14:49,759 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 02:14:49,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-09-08 02:14:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 02:14:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-09-08 02:14:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 02:14:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-09-08 02:14:49,766 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 20 [2019-09-08 02:14:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:49,766 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-09-08 02:14:49,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 02:14:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-09-08 02:14:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:14:49,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:49,767 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:49,767 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash -167613014, now seen corresponding path program 1 times [2019-09-08 02:14:49,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:49,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:49,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:50,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:14:50,172 INFO L223 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-08 02:14:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:50,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 02:14:50,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:14:50,255 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-08 02:14:50,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:14:50,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,322 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|, |v_#memory_int_45|, |v_#memory_$Pointer$.offset_35|], 2=[|v_#memory_int_42|]} [2019-09-08 02:14:50,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:50,341 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 19 [2019-09-08 02:14:50,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:50,409 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 38 treesize of output 15 [2019-09-08 02:14:50,409 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:50,451 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 19 [2019-09-08 02:14:50,452 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:50,508 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-08 02:14:50,508 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,532 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-08 02:14:50,533 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:120, output treesize:74 [2019-09-08 02:14:50,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-08 02:14:50,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,825 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-08 02:14:50,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,830 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|, |v_#memory_int_43|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.offset_36|], 10=[|v_#memory_int_46|]} [2019-09-08 02:14:50,842 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-08 02:14:50,996 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-09-08 02:14:50,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,001 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-08 02:14:51,177 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-08 02:14:51,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,230 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 34 treesize of output 25 [2019-09-08 02:14:51,231 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,409 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 02:14:51,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,431 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 62 treesize of output 43 [2019-09-08 02:14:51,432 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,542 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-08 02:14:51,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,563 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 34 treesize of output 25 [2019-09-08 02:14:51,564 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,670 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 62 treesize of output 43 [2019-09-08 02:14:51,670 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2019-09-08 02:14:51,734 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,780 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:249, output treesize:144 [2019-09-08 02:14:51,897 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|], 12=[|v_#memory_int_47|]} [2019-09-08 02:14:51,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,950 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 148 [2019-09-08 02:14:51,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,957 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-08 02:14:52,006 INFO L567 ElimStorePlain]: treesize reduction 54, result has 62.2 percent of original size [2019-09-08 02:14:52,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:52,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2019-09-08 02:14:52,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:52,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:52,034 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-09-08 02:14:52,035 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:52,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:52,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:52,046 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:158, output treesize:25 [2019-09-08 02:14:52,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,134 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|], 20=[|v_#memory_int_48|]} [2019-09-08 02:14:52,141 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 71 treesize of output 47 [2019-09-08 02:14:52,142 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-08 02:14:52,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:52,157 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 47 treesize of output 29 [2019-09-08 02:14:52,158 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-08 02:14:52,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:52,344 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 02:14:52,345 INFO L341 Elim1Store]: treesize reduction 24, result has 85.0 percent of original size [2019-09-08 02:14:52,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 156 [2019-09-08 02:14:52,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,351 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:52,587 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-08 02:14:52,587 INFO L567 ElimStorePlain]: treesize reduction 126, result has 51.9 percent of original size [2019-09-08 02:14:52,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:52,593 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:95, output treesize:135 [2019-09-08 02:14:52,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:52,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:57,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:14:57,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:14:57,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-09-08 02:14:57,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 02:14:57,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 02:14:57,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=219, Unknown=2, NotChecked=0, Total=272 [2019-09-08 02:14:57,630 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 17 states. [2019-09-08 02:14:57,925 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2019-09-08 02:14:58,195 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 72 [2019-09-08 02:15:02,567 WARN L188 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 125 DAG size of output: 96 [2019-09-08 02:15:02,728 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 63 [2019-09-08 02:15:03,202 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2019-09-08 02:15:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:15:03,389 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2019-09-08 02:15:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 02:15:03,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-08 02:15:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:15:03,392 INFO L225 Difference]: With dead ends: 39 [2019-09-08 02:15:03,392 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 02:15:03,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=117, Invalid=433, Unknown=2, NotChecked=0, Total=552 [2019-09-08 02:15:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 02:15:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-08 02:15:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:15:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-09-08 02:15:03,397 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 23 [2019-09-08 02:15:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:15:03,398 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-09-08 02:15:03,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 02:15:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-09-08 02:15:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:15:03,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:15:03,399 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:15:03,399 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:15:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:15:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash -165765972, now seen corresponding path program 1 times [2019-09-08 02:15:03,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:15:03,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:15:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:15:03,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:15:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:15:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:15:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:15:03,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:15:03,895 INFO L223 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-08 02:15:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:15:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:15:03,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 02:15:03,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:15:03,964 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-08 02:15:03,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:15:03,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:03,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:03,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:03,985 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 19 [2019-09-08 02:15:03,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,006 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-08 02:15:04,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:42 [2019-09-08 02:15:04,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-08 02:15:04,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,225 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-09-08 02:15:04,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,228 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_50|, |v_#memory_$Pointer$.offset_40|, |v_#memory_int_51|], 2=[|v_#memory_int_49|, |v_#memory_$Pointer$.base_41|], 6=[|v_#memory_$Pointer$.base_42|]} [2019-09-08 02:15:04,243 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-08 02:15:04,369 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-09-08 02:15:04,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-09-08 02:15:04,377 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-09-08 02:15:04,488 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,567 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 34 treesize of output 21 [2019-09-08 02:15:04,568 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,624 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-08 02:15:04,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:04,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2019-09-08 02:15:04,677 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,719 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:181, output treesize:111 [2019-09-08 02:15:04,839 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_int_52|], 15=[|v_#memory_$Pointer$.offset_41|], 20=[|v_#memory_$Pointer$.base_43|]} [2019-09-08 02:15:04,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:04,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:04,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2019-09-08 02:15:04,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:04,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:04,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:04,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 107 [2019-09-08 02:15:04,895 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:04,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:04,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:15:05,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:05,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 124 treesize of output 304 [2019-09-08 02:15:05,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:05,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:05,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:05,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:05,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:05,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:05,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,053 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-08 02:15:05,131 INFO L567 ElimStorePlain]: treesize reduction 190, result has 28.0 percent of original size [2019-09-08 02:15:05,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:15:05,132 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:234, output treesize:95 [2019-09-08 02:15:05,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,342 INFO L392 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_42|], 10=[|v_#memory_$Pointer$.base_44|], 20=[|v_#memory_int_53|]} [2019-09-08 02:15:05,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:05,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 88 [2019-09-08 02:15:05,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:05,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:05,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:05,396 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 5 case distinctions, treesize of input 108 treesize of output 67 [2019-09-08 02:15:05,397 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-08 02:15:05,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:05,414 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-09-08 02:15:05,414 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:05,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:05,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:05,425 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:198, output treesize:25 [2019-09-08 02:15:05,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:15:05,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:15:05,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2019-09-08 02:15:05,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 02:15:05,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 02:15:05,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-09-08 02:15:05,481 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 20 states. [2019-09-08 02:15:05,681 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2019-09-08 02:15:06,014 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 60 [2019-09-08 02:15:06,446 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 67 [2019-09-08 02:15:06,876 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-09-08 02:15:07,077 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-09-08 02:15:07,280 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-09-08 02:15:07,545 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-08 02:15:07,775 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-09-08 02:15:08,573 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-09-08 02:15:09,028 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-08 02:15:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:15:09,049 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-09-08 02:15:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:15:09,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-09-08 02:15:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:15:09,050 INFO L225 Difference]: With dead ends: 48 [2019-09-08 02:15:09,050 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:15:09,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 02:15:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:15:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-09-08 02:15:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 02:15:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-09-08 02:15:09,058 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2019-09-08 02:15:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:15:09,059 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-09-08 02:15:09,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 02:15:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2019-09-08 02:15:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:15:09,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:15:09,060 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:15:09,060 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:15:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:15:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash -165764050, now seen corresponding path program 1 times [2019-09-08 02:15:09,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:15:09,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:15:09,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:15:09,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:15:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:15:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:15:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:15:09,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:15:09,387 INFO L223 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-08 02:15:09,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:15:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:15:09,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:15:09,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:15:09,453 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-08 02:15:09,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:15:09,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:09,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:09,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:09,475 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 19 [2019-09-08 02:15:09,475 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:09,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:09,493 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-08 02:15:09,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:42 [2019-09-08 02:15:09,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:09,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-08 02:15:09,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:09,692 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-09-08 02:15:09,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:09,694 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|, |v_#memory_int_56|, |v_#memory_$Pointer$.offset_43|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_int_54|], 6=[|v_#memory_$Pointer$.base_47|]} [2019-09-08 02:15:09,699 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-08 02:15:09,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:09,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-09-08 02:15:09,822 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:09,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:09,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-09-08 02:15:09,918 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:09,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:09,983 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-08 02:15:10,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,038 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 34 treesize of output 21 [2019-09-08 02:15:10,038 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:10,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:10,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2019-09-08 02:15:10,088 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:10,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:15:10,123 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:181, output treesize:111 [2019-09-08 02:15:10,232 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_int_57|], 15=[|v_#memory_$Pointer$.offset_44|], 20=[|v_#memory_$Pointer$.base_48|]} [2019-09-08 02:15:10,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:10,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:10,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2019-09-08 02:15:10,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:10,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:10,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:10,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:10,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 107 [2019-09-08 02:15:10,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:10,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,341 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:15:10,432 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 124 treesize of output 304 [2019-09-08 02:15:10,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:10,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:10,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:10,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:10,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:10,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:10,441 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-08 02:15:10,511 INFO L567 ElimStorePlain]: treesize reduction 190, result has 28.0 percent of original size [2019-09-08 02:15:10,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:15:10,512 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:234, output treesize:95 [2019-09-08 02:15:10,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,743 INFO L392 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_45|], 10=[|v_#memory_$Pointer$.base_49|], 20=[|v_#memory_int_58|]} [2019-09-08 02:15:10,756 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 105 [2019-09-08 02:15:10,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:10,809 INFO L567 ElimStorePlain]: treesize reduction 7, result has 94.8 percent of original size [2019-09-08 02:15:10,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,827 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 5 case distinctions, treesize of input 123 treesize of output 74 [2019-09-08 02:15:10,829 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-08 02:15:10,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,861 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-09-08 02:15:10,861 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:10,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:10,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:10,871 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:233, output treesize:25 [2019-09-08 02:15:10,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 02:15:10,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:15:10,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-09-08 02:15:10,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 02:15:10,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 02:15:10,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-09-08 02:15:10,914 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 18 states. [2019-09-08 02:15:11,245 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-08 02:15:11,495 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 75 [2019-09-08 02:15:11,935 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-09-08 02:15:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:15:12,468 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-09-08 02:15:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 02:15:12,469 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-09-08 02:15:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:15:12,470 INFO L225 Difference]: With dead ends: 73 [2019-09-08 02:15:12,471 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 02:15:12,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2019-09-08 02:15:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 02:15:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2019-09-08 02:15:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 02:15:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-09-08 02:15:12,488 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 23 [2019-09-08 02:15:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:15:12,488 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-09-08 02:15:12,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 02:15:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2019-09-08 02:15:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 02:15:12,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:15:12,489 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:15:12,490 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:15:12,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:15:12,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1446394771, now seen corresponding path program 2 times [2019-09-08 02:15:12,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:15:12,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:15:12,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:15:12,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:15:12,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:15:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:15:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 02:15:13,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:15:13,099 INFO L223 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-08 02:15:13,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 02:15:13,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 02:15:13,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 02:15:13,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 02:15:13,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:15:13,231 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-08 02:15:13,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:15:13,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:13,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:13,306 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_50|, |v_#memory_int_62|], 2=[|v_#memory_int_59|]} [2019-09-08 02:15:13,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:13,319 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 19 [2019-09-08 02:15:13,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:13,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:13,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:13,386 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 19 [2019-09-08 02:15:13,386 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:13,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:13,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:13,447 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 38 treesize of output 15 [2019-09-08 02:15:13,447 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:13,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:13,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:13,489 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-08 02:15:13,490 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:13,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:13,519 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-08 02:15:13,519 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:120, output treesize:74 [2019-09-08 02:15:13,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:13,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-08 02:15:13,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:14,047 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-09-08 02:15:14,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:14,052 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_60|, |v_#memory_int_61|], 6=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.base_52|], 10=[|v_#memory_int_63|]} [2019-09-08 02:15:14,061 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-08 02:15:14,295 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-09-08 02:15:14,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:14,302 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-08 02:15:14,491 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-08 02:15:14,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:14,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:14,520 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 34 treesize of output 25 [2019-09-08 02:15:14,521 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:14,673 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 02:15:14,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:14,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:14,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:14,711 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 62 treesize of output 43 [2019-09-08 02:15:14,712 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:14,817 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-09-08 02:15:14,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:14,820 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-08 02:15:14,948 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-09-08 02:15:14,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:14,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:14,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:14,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:14,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:14,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2019-09-08 02:15:14,966 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:15,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:15,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:15,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:15,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:15,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:15:15,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2019-09-08 02:15:15,053 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:15,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:15,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:15:15,104 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:249, output treesize:144 [2019-09-08 02:15:15,236 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_53|], 12=[|v_#memory_int_64|]} [2019-09-08 02:15:15,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:15,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 87 [2019-09-08 02:15:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,245 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-08 02:15:15,288 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.4 percent of original size [2019-09-08 02:15:15,355 INFO L341 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2019-09-08 02:15:15,356 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 5 case distinctions, treesize of input 83 treesize of output 98 [2019-09-08 02:15:15,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,360 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-08 02:15:15,398 INFO L567 ElimStorePlain]: treesize reduction 42, result has 53.3 percent of original size [2019-09-08 02:15:15,401 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-09-08 02:15:15,402 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:15,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:15,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:15,414 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:158, output treesize:25 [2019-09-08 02:15:15,489 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_50|, |v_#memory_$Pointer$.base_54|], 20=[|v_#memory_int_65|]} [2019-09-08 02:15:15,493 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 71 treesize of output 53 [2019-09-08 02:15:15,494 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-08 02:15:15,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:15,516 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 53 treesize of output 29 [2019-09-08 02:15:15,517 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-08 02:15:15,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:15,717 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 02:15:15,717 INFO L341 Elim1Store]: treesize reduction 24, result has 85.0 percent of original size [2019-09-08 02:15:15,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 156 [2019-09-08 02:15:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,722 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:15,894 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-08 02:15:15,894 INFO L567 ElimStorePlain]: treesize reduction 129, result has 51.0 percent of original size [2019-09-08 02:15:15,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:15,899 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:95, output treesize:133 [2019-09-08 02:15:15,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:20,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:20,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:20,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:21,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:22,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:22,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:32,253 WARN L188 SmtUtils]: Spent 9.17 s on a formula simplification. DAG size of input: 131 DAG size of output: 68 [2019-09-08 02:15:32,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-08 02:15:32,267 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_30, v_prenex_23, v_prenex_33, v_prenex_18, |v_#memory_$Pointer$.offset_51|, v_prenex_17, v_prenex_27, |v_#memory_$Pointer$.base_55|], 20=[v_prenex_29], 30=[v_prenex_14, |v_#memory_int_66|], 42=[v_prenex_21]} [2019-09-08 02:15:32,278 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 89 treesize of output 65 [2019-09-08 02:15:32,279 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-08 02:15:32,547 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 154 [2019-09-08 02:15:32,548 INFO L567 ElimStorePlain]: treesize reduction 26, result has 93.6 percent of original size [2019-09-08 02:15:32,561 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 114 treesize of output 90 [2019-09-08 02:15:32,562 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-08 02:15:32,707 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-09-08 02:15:32,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:32,726 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 65 treesize of output 47 [2019-09-08 02:15:32,727 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-08 02:15:32,881 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-09-08 02:15:32,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:32,897 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 99 treesize of output 75 [2019-09-08 02:15:32,898 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-08 02:15:33,037 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-09-08 02:15:33,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:33,046 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 99 treesize of output 81 [2019-09-08 02:15:33,047 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-08 02:15:33,184 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-09-08 02:15:33,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:33,202 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 75 treesize of output 57 [2019-09-08 02:15:33,203 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-08 02:15:33,336 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-09-08 02:15:33,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:33,364 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 90 treesize of output 72 [2019-09-08 02:15:33,365 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:33,492 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-09-08 02:15:33,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:33,503 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 81 treesize of output 57 [2019-09-08 02:15:33,504 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:33,644 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-08 02:15:33,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:33,835 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 02:15:33,835 INFO L341 Elim1Store]: treesize reduction 24, result has 85.0 percent of original size [2019-09-08 02:15:33,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 158 [2019-09-08 02:15:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:33,839 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:34,284 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 158 [2019-09-08 02:15:34,285 INFO L567 ElimStorePlain]: treesize reduction 123, result has 71.7 percent of original size [2019-09-08 02:15:34,571 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2019-09-08 02:15:34,572 INFO L341 Elim1Store]: treesize reduction 48, result has 79.0 percent of original size [2019-09-08 02:15:34,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 57 treesize of output 209 [2019-09-08 02:15:34,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:34,591 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:36,072 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 266 DAG size of output: 210 [2019-09-08 02:15:36,072 INFO L567 ElimStorePlain]: treesize reduction 447, result has 59.5 percent of original size [2019-09-08 02:15:36,350 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2019-09-08 02:15:36,350 INFO L341 Elim1Store]: treesize reduction 48, result has 79.0 percent of original size [2019-09-08 02:15:36,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 57 treesize of output 209 [2019-09-08 02:15:36,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:36,371 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:38,192 WARN L188 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 301 DAG size of output: 254 [2019-09-08 02:15:38,192 INFO L567 ElimStorePlain]: treesize reduction 540, result has 61.4 percent of original size [2019-09-08 02:15:38,556 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 91 [2019-09-08 02:15:38,556 INFO L341 Elim1Store]: treesize reduction 72, result has 75.8 percent of original size [2019-09-08 02:15:38,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 72 treesize of output 265 [2019-09-08 02:15:38,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:38,578 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:41,340 WARN L188 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 405 DAG size of output: 312 [2019-09-08 02:15:41,341 INFO L567 ElimStorePlain]: treesize reduction 863, result has 58.2 percent of original size [2019-09-08 02:15:41,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:41,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:41,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 12 dim-2 vars, End of recursive call: 33 dim-0 vars, and 4 xjuncts. [2019-09-08 02:15:41,408 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 32 variables, input treesize:428, output treesize:1193 [2019-09-08 02:15:41,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:41,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:15:41,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:41,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,242 WARN L188 SmtUtils]: Spent 30.17 s on a formula simplification that was a NOOP. DAG size: 328 [2019-09-08 02:16:20,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:16:20,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:16:20,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms