/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:16:39,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:16:39,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:16:39,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:16:39,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:16:39,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:16:39,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:16:39,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:16:39,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:16:39,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:16:39,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:16:39,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:16:39,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:16:40,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:16:40,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:16:40,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:16:40,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:16:40,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:16:40,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:16:40,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:16:40,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:16:40,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:16:40,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:16:40,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:16:40,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:16:40,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:16:40,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:16:40,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:16:40,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:16:40,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:16:40,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:16:40,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:16:40,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:16:40,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:16:40,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:16:40,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:16:40,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:16:40,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:16:40,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:16:40,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:16:40,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:16:40,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:16:40,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:16:40,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:16:40,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:16:40,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:16:40,058 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:16:40,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:16:40,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:16:40,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:16:40,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:16:40,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:16:40,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:16:40,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:16:40,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:16:40,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:16:40,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:16:40,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:16:40,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:16:40,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:16:40,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:16:40,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:16:40,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:16:40,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:16:40,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:16:40,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:16:40,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:16:40,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:16:40,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:16:40,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:16:40,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:16:40,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:16:40,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:16:40,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:16:40,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:16:40,377 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:16:40,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2019-11-06 21:16:40,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4e99329/d50457a866b0457381c15a8b0101eafb/FLAG1e02ed943 [2019-11-06 21:16:41,022 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:16:41,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2019-11-06 21:16:41,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4e99329/d50457a866b0457381c15a8b0101eafb/FLAG1e02ed943 [2019-11-06 21:16:41,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4e99329/d50457a866b0457381c15a8b0101eafb [2019-11-06 21:16:41,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:16:41,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:16:41,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:16:41,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:16:41,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:16:41,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:41" (1/1) ... [2019-11-06 21:16:41,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4170af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:41, skipping insertion in model container [2019-11-06 21:16:41,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:41" (1/1) ... [2019-11-06 21:16:41,347 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:16:41,405 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:16:41,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:16:41,925 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:16:41,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:16:42,033 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:16:42,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42 WrapperNode [2019-11-06 21:16:42,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:16:42,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:16:42,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:16:42,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:16:42,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2019-11-06 21:16:42,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2019-11-06 21:16:42,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2019-11-06 21:16:42,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2019-11-06 21:16:42,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2019-11-06 21:16:42,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2019-11-06 21:16:42,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... [2019-11-06 21:16:42,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:16:42,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:16:42,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:16:42,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:16:42,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:16:42,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:16:42,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:16:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:16:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:16:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:16:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-06 21:16:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-06 21:16:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-06 21:16:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-11-06 21:16:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-11-06 21:16:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:16:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:16:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:16:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:16:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:16:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:16:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:16:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:16:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:16:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:16:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:16:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:16:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:16:42,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:16:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:16:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:16:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:16:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:16:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:16:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:16:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:16:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:16:42,185 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:16:42,185 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:16:42,185 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:16:42,185 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:16:42,185 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:16:42,185 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:16:42,185 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:16:42,186 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:16:42,186 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:16:42,186 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:16:42,186 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:16:42,186 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:16:42,186 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:16:42,187 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:16:42,187 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:16:42,187 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:16:42,187 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:16:42,187 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:16:42,187 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:16:42,188 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:16:42,188 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:16:42,188 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:16:42,188 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:16:42,188 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:16:42,188 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:16:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:16:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 21:16:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:16:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:16:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:16:42,189 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:16:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:16:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:16:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:16:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:16:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:16:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:16:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:16:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:16:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:16:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:16:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:16:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:16:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:16:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:16:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:16:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:16:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:16:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:16:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:16:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:16:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:16:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:16:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:16:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:16:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:16:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:16:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:16:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:16:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:16:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:16:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:16:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:16:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:16:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:16:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:16:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:16:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:16:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:16:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:16:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:16:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:16:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:16:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:16:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:16:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:16:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-06 21:16:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:16:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:16:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:16:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-06 21:16:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-06 21:16:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:16:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:16:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-11-06 21:16:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:16:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-11-06 21:16:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:16:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:16:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:16:42,650 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:16:42,765 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:16:42,766 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-06 21:16:42,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:42 BoogieIcfgContainer [2019-11-06 21:16:42,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:16:42,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:16:42,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:16:42,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:16:42,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:16:41" (1/3) ... [2019-11-06 21:16:42,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351df986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:42, skipping insertion in model container [2019-11-06 21:16:42,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:42" (2/3) ... [2019-11-06 21:16:42,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351df986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:42, skipping insertion in model container [2019-11-06 21:16:42,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:42" (3/3) ... [2019-11-06 21:16:42,775 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2019-11-06 21:16:42,785 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:16:42,794 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:16:42,806 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:16:42,831 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:16:42,831 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:16:42,832 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:16:42,832 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:16:42,832 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:16:42,832 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:16:42,832 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:16:42,833 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:16:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-06 21:16:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:16:42,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:42,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:42,864 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1661227511, now seen corresponding path program 1 times [2019-11-06 21:16:42,880 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:42,881 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580304859] [2019-11-06 21:16:42,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:43,221 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580304859] [2019-11-06 21:16:43,222 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:16:43,223 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:16:43,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344308364] [2019-11-06 21:16:43,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:16:43,235 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:16:43,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:16:43,272 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2019-11-06 21:16:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:43,515 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2019-11-06 21:16:43,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:16:43,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-06 21:16:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:43,526 INFO L225 Difference]: With dead ends: 101 [2019-11-06 21:16:43,527 INFO L226 Difference]: Without dead ends: 45 [2019-11-06 21:16:43,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:16:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-06 21:16:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-06 21:16:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 21:16:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-11-06 21:16:43,579 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2019-11-06 21:16:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:43,581 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-06 21:16:43,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:16:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-11-06 21:16:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:16:43,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:43,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:43,584 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1248070634, now seen corresponding path program 1 times [2019-11-06 21:16:43,585 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:43,585 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095070654] [2019-11-06 21:16:43,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:43,779 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095070654] [2019-11-06 21:16:43,779 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:16:43,779 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:16:43,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968632700] [2019-11-06 21:16:43,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:16:43,782 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:43,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:16:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:16:43,783 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 6 states. [2019-11-06 21:16:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:44,060 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-11-06 21:16:44,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:16:44,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-06 21:16:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:44,062 INFO L225 Difference]: With dead ends: 68 [2019-11-06 21:16:44,063 INFO L226 Difference]: Without dead ends: 55 [2019-11-06 21:16:44,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:16:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-06 21:16:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-11-06 21:16:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 21:16:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-11-06 21:16:44,075 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2019-11-06 21:16:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:44,076 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-11-06 21:16:44,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:16:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-11-06 21:16:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 21:16:44,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:44,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:44,078 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2064355028, now seen corresponding path program 1 times [2019-11-06 21:16:44,079 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:44,079 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057117676] [2019-11-06 21:16:44,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:44,423 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057117676] [2019-11-06 21:16:44,424 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142218980] [2019-11-06 21:16:44,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:44,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:16:44,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:16:44,664 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:16:44,664 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 17 [2019-11-06 21:16:44,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097343630] [2019-11-06 21:16:44,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:16:44,667 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:44,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:16:44,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:16:44,668 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 5 states. [2019-11-06 21:16:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:44,736 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2019-11-06 21:16:44,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:16:44,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-06 21:16:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:44,739 INFO L225 Difference]: With dead ends: 77 [2019-11-06 21:16:44,739 INFO L226 Difference]: Without dead ends: 51 [2019-11-06 21:16:44,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:16:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-06 21:16:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-11-06 21:16:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-06 21:16:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-11-06 21:16:44,749 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2019-11-06 21:16:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:44,750 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-11-06 21:16:44,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:16:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-11-06 21:16:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 21:16:44,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:44,752 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:44,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:44,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1202630968, now seen corresponding path program 1 times [2019-11-06 21:16:44,967 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:44,967 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565614613] [2019-11-06 21:16:44,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:16:45,230 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565614613] [2019-11-06 21:16:45,230 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833852131] [2019-11-06 21:16:45,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:16:45,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:16:45,404 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:16:45,405 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2019-11-06 21:16:45,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217727958] [2019-11-06 21:16:45,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:16:45,406 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:45,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:16:45,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:16:45,406 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2019-11-06 21:16:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:45,510 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-11-06 21:16:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:16:45,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-06 21:16:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:45,514 INFO L225 Difference]: With dead ends: 81 [2019-11-06 21:16:45,514 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 21:16:45,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:16:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 21:16:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-11-06 21:16:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:16:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-06 21:16:45,525 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 50 [2019-11-06 21:16:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:45,526 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-06 21:16:45,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:16:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-11-06 21:16:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 21:16:45,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:45,528 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:45,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:45,739 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1117742799, now seen corresponding path program 1 times [2019-11-06 21:16:45,740 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:45,740 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091959877] [2019-11-06 21:16:45,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:16:45,963 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091959877] [2019-11-06 21:16:45,963 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468510789] [2019-11-06 21:16:45,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:46,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:16:46,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:16:46,152 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:46,152 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2019-11-06 21:16:46,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962464754] [2019-11-06 21:16:46,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:16:46,153 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:46,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:16:46,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:16:46,154 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 14 states. [2019-11-06 21:16:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:46,592 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2019-11-06 21:16:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:16:46,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2019-11-06 21:16:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:46,595 INFO L225 Difference]: With dead ends: 79 [2019-11-06 21:16:46,595 INFO L226 Difference]: Without dead ends: 66 [2019-11-06 21:16:46,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:16:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-06 21:16:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-11-06 21:16:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-06 21:16:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-06 21:16:46,608 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 51 [2019-11-06 21:16:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:46,609 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-06 21:16:46,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:16:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-06 21:16:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 21:16:46,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:46,611 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:46,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:46,815 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash -475790904, now seen corresponding path program 1 times [2019-11-06 21:16:46,816 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:46,816 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453759234] [2019-11-06 21:16:46,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:16:48,582 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453759234] [2019-11-06 21:16:48,582 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555522300] [2019-11-06 21:16:48,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:48,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 108 conjunts are in the unsatisfiable core [2019-11-06 21:16:48,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:48,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:16:48,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:48,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:48,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:48,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:16:49,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:49,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:16:49,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:49,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-06 21:16:49,297 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 11 treesize of output 7 [2019-11-06 21:16:49,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:49,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-06 21:16:49,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-06 21:16:49,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:49,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:49,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-06 21:16:49,568 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_28|], 10=[|v_#memory_$Pointer$.base_30|]} [2019-11-06 21:16:49,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2019-11-06 21:16:49,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:49,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:49,730 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-06 21:16:49,731 INFO L341 Elim1Store]: treesize reduction 43, result has 72.4 percent of original size [2019-11-06 21:16:49,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 139 [2019-11-06 21:16:49,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,795 INFO L567 ElimStorePlain]: treesize reduction 155, result has 32.3 percent of original size [2019-11-06 21:16:49,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:49,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:116, output treesize:77 [2019-11-06 21:16:51,916 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-06 21:16:54,022 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-06 21:16:56,129 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-06 21:16:58,229 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-06 21:16:58,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-11-06 21:16:58,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:58,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:58,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:58,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2019-11-06 21:16:58,522 INFO L392 ElimStorePlain]: Different costs {12=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_15|], 20=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_15|]} [2019-11-06 21:16:58,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:58,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:58,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 155 [2019-11-06 21:16:58,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:58,601 INFO L567 ElimStorePlain]: treesize reduction 50, result has 75.7 percent of original size [2019-11-06 21:16:58,952 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-11-06 21:16:58,952 INFO L341 Elim1Store]: treesize reduction 10, result has 97.1 percent of original size [2019-11-06 21:16:58,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 425 [2019-11-06 21:16:58,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:58,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:58,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:58,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:58,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:59,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2019-11-06 21:17:00,946 WARN L191 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 197 DAG size of output: 48 [2019-11-06 21:17:00,947 INFO L567 ElimStorePlain]: treesize reduction 32479, result has 0.7 percent of original size [2019-11-06 21:17:00,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:17:00,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:180 [2019-11-06 21:17:02,914 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_int)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_dll_circular_update_at_#in~head.base|) .cse0 dll_circular_update_at_~data)) |c_#memory_int|) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) is different from true [2019-11-06 21:17:02,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:02,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:02,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:02,969 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_int)_AFTER_CALL_16|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|]} [2019-11-06 21:17:02,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 133 [2019-11-06 21:17:02,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:03,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 114 [2019-11-06 21:17:03,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:03,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:03,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,188 INFO L341 Elim1Store]: treesize reduction 36, result has 65.4 percent of original size [2019-11-06 21:17:03,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 161 [2019-11-06 21:17:03,191 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:03,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 90 [2019-11-06 21:17:03,215 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:03,408 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-11-06 21:17:03,409 INFO L567 ElimStorePlain]: treesize reduction 74, result has 73.4 percent of original size [2019-11-06 21:17:03,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,443 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 92 treesize of output 75 [2019-11-06 21:17:03,444 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:03,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:03,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 98 [2019-11-06 21:17:03,466 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:03,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:03,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:17:03,539 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:250, output treesize:142 [2019-11-06 21:17:04,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:04,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms