java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:07:30,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:07:30,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:07:30,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:07:30,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:07:30,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:07:30,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:07:30,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:07:30,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:07:30,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:07:30,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:07:30,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:07:30,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:07:30,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:07:30,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:07:30,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:07:30,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:07:30,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:07:30,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:07:30,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:07:30,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:07:30,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:07:30,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:07:30,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:07:30,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:07:30,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:07:30,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:07:30,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:07:30,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:07:30,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:07:30,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:07:30,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:07:30,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:07:30,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:07:30,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:07:30,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:07:30,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:07:30,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:07:30,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:07:30,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:07:30,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:07:30,115 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-10-14 22:07:30,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:07:30,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:07:30,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:07:30,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:07:30,138 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:07:30,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:07:30,139 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:07:30,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:07:30,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:07:30,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:07:30,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:07:30,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:07:30,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:07:30,141 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:07:30,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:07:30,142 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:07:30,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:07:30,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:07:30,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:07:30,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:07:30,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:07:30,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:30,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:07:30,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:07:30,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:07:30,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:07:30,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:07:30,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:07:30,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:07:30,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:07:30,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:07:30,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:07:30,452 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:07:30,452 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:07:30,453 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i [2019-10-14 22:07:30,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55b85c95/50e3b2a3c8ec4fe1b3cf32b135968314/FLAG508a02860 [2019-10-14 22:07:31,045 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:07:31,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i [2019-10-14 22:07:31,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55b85c95/50e3b2a3c8ec4fe1b3cf32b135968314/FLAG508a02860 [2019-10-14 22:07:31,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55b85c95/50e3b2a3c8ec4fe1b3cf32b135968314 [2019-10-14 22:07:31,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:07:31,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:07:31,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:31,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:07:31,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:07:31,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:31,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2e6592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31, skipping insertion in model container [2019-10-14 22:07:31,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:31,371 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:07:31,426 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:07:31,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:31,879 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:07:31,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:31,979 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:07:31,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31 WrapperNode [2019-10-14 22:07:31,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:31,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:07:31,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:07:31,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:07:31,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:31,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:32,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:32,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:32,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:32,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:32,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (1/1) ... [2019-10-14 22:07:32,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:07:32,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:07:32,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:07:32,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:07:32,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (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-10-14 22:07:32,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:07:32,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:07:32,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:07:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:07:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:07:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:07:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:07:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:07:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:07:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:07:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:07:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:07:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:07:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:07:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:07:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:07:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:07:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:07:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:07:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:07:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:07:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:07:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:07:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:07:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:07:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:07:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:07:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:07:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:07:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:07:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:07:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:07:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:07:32,110 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:07:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:07:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:07:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:07:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:07:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:07:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:07:32,111 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:07:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:07:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:07:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:07:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:07:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:07:32,112 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:07:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:07:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:07:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:07:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:07:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:07:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:07:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:07:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:07:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:07:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:07:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:07:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:07:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:07:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:07:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:07:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:07:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:07:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:07:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:07:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:07:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:07:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:07:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:07:32,116 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:07:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:07:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:07:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:07:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:07:32,117 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:07:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:07:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:07:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:07:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:07:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:07:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:07:32,118 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:07:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:07:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:07:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:07:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:07:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:07:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:07:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:07:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:07:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:07:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:07:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:07:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:07:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:07:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:07:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:07:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:07:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:07:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:07:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:07:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:07:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:07:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:07:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:07:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:07:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:07:32,709 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:07:32,710 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-14 22:07:32,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:32 BoogieIcfgContainer [2019-10-14 22:07:32,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:07:32,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:07:32,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:07:32,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:07:32,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:31" (1/3) ... [2019-10-14 22:07:32,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e22c6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:32, skipping insertion in model container [2019-10-14 22:07:32,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:31" (2/3) ... [2019-10-14 22:07:32,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e22c6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:32, skipping insertion in model container [2019-10-14 22:07:32,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:32" (3/3) ... [2019-10-14 22:07:32,724 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2019-10-14 22:07:32,734 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:07:32,743 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 22:07:32,755 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 22:07:32,779 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:07:32,780 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:07:32,780 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:07:32,780 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:07:32,780 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:07:32,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:07:32,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:07:32,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:07:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 22:07:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 22:07:32,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:32,806 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:32,808 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1759752198, now seen corresponding path program 1 times [2019-10-14 22:07:32,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:32,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391818021] [2019-10-14 22:07:32,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:32,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:32,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:33,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391818021] [2019-10-14 22:07:33,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:33,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:07:33,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967135966] [2019-10-14 22:07:33,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:07:33,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:07:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:33,060 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-10-14 22:07:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:33,228 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2019-10-14 22:07:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:07:33,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-14 22:07:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:33,242 INFO L225 Difference]: With dead ends: 53 [2019-10-14 22:07:33,243 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 22:07:33,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:07:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 22:07:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 22:07:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 22:07:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-10-14 22:07:33,305 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2019-10-14 22:07:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:33,306 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-14 22:07:33,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:07:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-10-14 22:07:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 22:07:33,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:33,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:33,308 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash -666433660, now seen corresponding path program 1 times [2019-10-14 22:07:33,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:33,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462000382] [2019-10-14 22:07:33,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:33,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:33,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:33,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462000382] [2019-10-14 22:07:33,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:33,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:07:33,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745016708] [2019-10-14 22:07:33,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:07:33,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:07:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:33,614 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 8 states. [2019-10-14 22:07:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:33,934 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-14 22:07:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:07:33,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-14 22:07:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:33,938 INFO L225 Difference]: With dead ends: 47 [2019-10-14 22:07:33,938 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 22:07:33,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:07:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 22:07:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-10-14 22:07:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-14 22:07:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-10-14 22:07:33,959 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2019-10-14 22:07:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:33,959 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-10-14 22:07:33,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:07:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-10-14 22:07:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 22:07:33,962 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:33,962 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:33,963 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1010508073, now seen corresponding path program 1 times [2019-10-14 22:07:33,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:33,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838287915] [2019-10-14 22:07:33,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:33,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:33,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:34,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838287915] [2019-10-14 22:07:34,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900261341] [2019-10-14 22:07:34,154 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-10-14 22:07:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:34,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 22:07:34,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:34,366 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-10-14 22:07:34,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:34,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-14 22:07:34,397 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:34,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-14 22:07:34,415 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,425 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:20 [2019-10-14 22:07:34,457 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,458 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-10-14 22:07:34,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,505 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:34,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,545 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:34,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:34,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-10-14 22:07:34,582 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:34,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-10-14 22:07:34,612 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,630 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:39 [2019-10-14 22:07:34,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-10-14 22:07:34,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:34,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:34,760 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:34,799 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-10-14 22:07:34,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-10-14 22:07:34,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:34,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:34,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-10-14 22:07:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:34,825 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:34,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-10-14 22:07:34,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618468726] [2019-10-14 22:07:34,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 22:07:34,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:34,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 22:07:34,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:07:34,828 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 11 states. [2019-10-14 22:07:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:35,401 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-10-14 22:07:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 22:07:35,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-10-14 22:07:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:35,403 INFO L225 Difference]: With dead ends: 74 [2019-10-14 22:07:35,403 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 22:07:35,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-10-14 22:07:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 22:07:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2019-10-14 22:07:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 22:07:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-10-14 22:07:35,411 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 19 [2019-10-14 22:07:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:35,412 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-10-14 22:07:35,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 22:07:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-10-14 22:07:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:07:35,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:35,413 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:35,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:35,616 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -687403823, now seen corresponding path program 1 times [2019-10-14 22:07:35,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:35,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232682337] [2019-10-14 22:07:35,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:35,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:35,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:35,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232682337] [2019-10-14 22:07:35,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:35,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:07:35,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278563574] [2019-10-14 22:07:35,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:07:35,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:35,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:07:35,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:35,756 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 9 states. [2019-10-14 22:07:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:36,045 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2019-10-14 22:07:36,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:07:36,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-14 22:07:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:36,048 INFO L225 Difference]: With dead ends: 78 [2019-10-14 22:07:36,048 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 22:07:36,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:07:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 22:07:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-10-14 22:07:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 22:07:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-10-14 22:07:36,058 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 20 [2019-10-14 22:07:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:36,059 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-10-14 22:07:36,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:07:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-10-14 22:07:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 22:07:36,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:36,060 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:36,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:36,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1938777486, now seen corresponding path program 2 times [2019-10-14 22:07:36,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:36,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461778475] [2019-10-14 22:07:36,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:36,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:36,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:07:36,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461778475] [2019-10-14 22:07:36,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:36,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:07:36,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124380813] [2019-10-14 22:07:36,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:36,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:36,187 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 7 states. [2019-10-14 22:07:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:36,350 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-10-14 22:07:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:07:36,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-14 22:07:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:36,352 INFO L225 Difference]: With dead ends: 59 [2019-10-14 22:07:36,352 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 22:07:36,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:07:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 22:07:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2019-10-14 22:07:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 22:07:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-10-14 22:07:36,360 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 21 [2019-10-14 22:07:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:36,360 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-10-14 22:07:36,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-10-14 22:07:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 22:07:36,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:36,362 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:36,362 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1961949386, now seen corresponding path program 1 times [2019-10-14 22:07:36,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:36,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344421550] [2019-10-14 22:07:36,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:36,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:36,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:36,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344421550] [2019-10-14 22:07:36,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:36,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:07:36,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573889944] [2019-10-14 22:07:36,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:07:36,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:36,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:07:36,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:07:36,510 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 8 states. [2019-10-14 22:07:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:36,729 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2019-10-14 22:07:36,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:07:36,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-10-14 22:07:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:36,730 INFO L225 Difference]: With dead ends: 63 [2019-10-14 22:07:36,730 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 22:07:36,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-14 22:07:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 22:07:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-10-14 22:07:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 22:07:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-10-14 22:07:36,737 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2019-10-14 22:07:36,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:36,737 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-10-14 22:07:36,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:07:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-10-14 22:07:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 22:07:36,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:36,739 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:36,739 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash -361877940, now seen corresponding path program 1 times [2019-10-14 22:07:36,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:36,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215927628] [2019-10-14 22:07:36,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:36,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:36,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:36,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215927628] [2019-10-14 22:07:36,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923947662] [2019-10-14 22:07:36,969 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-10-14 22:07:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:37,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-14 22:07:37,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:37,097 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-10-14 22:07:37,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:37,155 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:37,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,287 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-14 22:07:37,287 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2019-10-14 22:07:37,293 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:37,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,342 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:37,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-10-14 22:07:37,414 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:07:37,456 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:07:37,488 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,513 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:122, output treesize:66 [2019-10-14 22:07:37,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:37,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,658 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 1=[|v_#memory_int_23|, |v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|]} [2019-10-14 22:07:37,662 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:37,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,709 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:37,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:07:37,771 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,828 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.9 percent of original size [2019-10-14 22:07:37,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:37,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-10-14 22:07:37,836 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:37,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 77 [2019-10-14 22:07:37,888 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,953 INFO L567 ElimStorePlain]: treesize reduction 48, result has 64.4 percent of original size [2019-10-14 22:07:37,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:37,955 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:141, output treesize:90 [2019-10-14 22:07:38,246 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-10-14 22:07:38,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 90 [2019-10-14 22:07:38,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,255 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:38,295 INFO L567 ElimStorePlain]: treesize reduction 24, result has 73.0 percent of original size [2019-10-14 22:07:38,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:38,326 INFO L341 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-10-14 22:07:38,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 42 [2019-10-14 22:07:38,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,351 INFO L567 ElimStorePlain]: treesize reduction 8, result has 78.9 percent of original size [2019-10-14 22:07:38,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:38,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:30 [2019-10-14 22:07:38,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:38,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 30 [2019-10-14 22:07:38,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:38,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,443 INFO L567 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2019-10-14 22:07:38,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:38,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:3 [2019-10-14 22:07:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:38,479 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:38,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-10-14 22:07:38,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133570019] [2019-10-14 22:07:38,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:07:38,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:38,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:07:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:07:38,481 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 18 states. [2019-10-14 22:07:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:39,917 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2019-10-14 22:07:39,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 22:07:39,918 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-10-14 22:07:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:39,918 INFO L225 Difference]: With dead ends: 97 [2019-10-14 22:07:39,919 INFO L226 Difference]: Without dead ends: 95 [2019-10-14 22:07:39,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 22:07:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-14 22:07:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 53. [2019-10-14 22:07:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 22:07:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-10-14 22:07:39,928 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 22 [2019-10-14 22:07:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:39,929 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-10-14 22:07:39,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 22:07:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-10-14 22:07:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:07:39,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:39,930 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:40,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:40,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:40,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:40,134 INFO L82 PathProgramCache]: Analyzing trace with hash -319739169, now seen corresponding path program 2 times [2019-10-14 22:07:40,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:40,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146998087] [2019-10-14 22:07:40,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:40,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:40,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146998087] [2019-10-14 22:07:40,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430915553] [2019-10-14 22:07:40,400 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-14 22:07:40,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:40,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:40,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-14 22:07:40,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:40,528 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-10-14 22:07:40,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:40,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:40,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,681 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.9 percent of original size [2019-10-14 22:07:40,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-10-14 22:07:40,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,728 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:40,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:07:40,756 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:07:40,783 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,804 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:104, output treesize:55 [2019-10-14 22:07:40,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:40,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:40,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,913 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|, |v_#memory_int_24|, |v_#memory_$Pointer$.offset_34|], 1=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-10-14 22:07:40,920 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:40,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:40,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-10-14 22:07:40,970 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,003 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:41,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 74 [2019-10-14 22:07:41,069 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,131 INFO L567 ElimStorePlain]: treesize reduction 48, result has 63.6 percent of original size [2019-10-14 22:07:41,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:41,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-10-14 22:07:41,140 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,167 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:130, output treesize:87 [2019-10-14 22:07:41,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:41,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-10-14 22:07:41,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,400 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-10-14 22:07:41,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:107, output treesize:91 [2019-10-14 22:07:41,623 INFO L341 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-10-14 22:07:41,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 143 [2019-10-14 22:07:41,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:41,684 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:41,729 INFO L567 ElimStorePlain]: treesize reduction 97, result has 34.9 percent of original size [2019-10-14 22:07:41,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2019-10-14 22:07:41,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:41,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:41,752 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:7 [2019-10-14 22:07:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:41,757 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:41,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-10-14 22:07:41,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615497329] [2019-10-14 22:07:41,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 22:07:41,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 22:07:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=293, Unknown=2, NotChecked=0, Total=342 [2019-10-14 22:07:41,759 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 19 states. [2019-10-14 22:07:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:43,113 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2019-10-14 22:07:43,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:07:43,114 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-10-14 22:07:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:43,115 INFO L225 Difference]: With dead ends: 108 [2019-10-14 22:07:43,115 INFO L226 Difference]: Without dead ends: 82 [2019-10-14 22:07:43,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=646, Unknown=2, NotChecked=0, Total=756 [2019-10-14 22:07:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-14 22:07:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2019-10-14 22:07:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 22:07:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-10-14 22:07:43,126 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 25 [2019-10-14 22:07:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:43,126 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-10-14 22:07:43,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 22:07:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-10-14 22:07:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:07:43,128 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:43,128 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:43,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:43,333 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:43,333 INFO L82 PathProgramCache]: Analyzing trace with hash -986080041, now seen corresponding path program 1 times [2019-10-14 22:07:43,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:43,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350129323] [2019-10-14 22:07:43,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:43,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:43,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:43,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350129323] [2019-10-14 22:07:43,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709203772] [2019-10-14 22:07:43,602 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-10-14 22:07:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:43,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 22:07:43,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:43,728 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-10-14 22:07:43,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:07:43,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,763 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2019-10-14 22:07:43,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,816 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-10-14 22:07:43,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,855 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_38|], 2=[|v_#memory_$Pointer$.base_37|, |v_#memory_int_28|], 4=[|v_#memory_int_26|]} [2019-10-14 22:07:43,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:07:43,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:07:43,899 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 22:07:43,929 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:43,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:07:43,950 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:43,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:43,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:43,966 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:101, output treesize:42 [2019-10-14 22:07:44,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2019-10-14 22:07:44,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,078 INFO L567 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size [2019-10-14 22:07:44,079 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-10-14 22:07:44,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:23 [2019-10-14 22:07:44,129 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_int_27|], 6=[|v_#memory_int_29|]} [2019-10-14 22:07:44,132 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:44,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,182 INFO L341 Elim1Store]: treesize reduction 69, result has 31.7 percent of original size [2019-10-14 22:07:44,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2019-10-14 22:07:44,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:44,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:44,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:44,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:44,204 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:45 [2019-10-14 22:07:44,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:44,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:07:46,344 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-10-14 22:07:46,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-10-14 22:07:46,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:46,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:46,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-14 22:07:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:46,361 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:46,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-10-14 22:07:46,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075270275] [2019-10-14 22:07:46,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 22:07:46,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 22:07:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-14 22:07:46,363 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 16 states. [2019-10-14 22:07:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:47,232 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2019-10-14 22:07:47,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 22:07:47,232 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-10-14 22:07:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:47,234 INFO L225 Difference]: With dead ends: 112 [2019-10-14 22:07:47,234 INFO L226 Difference]: Without dead ends: 103 [2019-10-14 22:07:47,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-10-14 22:07:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-14 22:07:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2019-10-14 22:07:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-14 22:07:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-10-14 22:07:47,246 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 25 [2019-10-14 22:07:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:47,246 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-10-14 22:07:47,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 22:07:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-10-14 22:07:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 22:07:47,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:47,248 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:47,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:47,452 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:47,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash -421093171, now seen corresponding path program 1 times [2019-10-14 22:07:47,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:47,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072139767] [2019-10-14 22:07:47,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:47,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:47,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:47,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072139767] [2019-10-14 22:07:47,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253267559] [2019-10-14 22:07:47,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:47,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-14 22:07:47,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:47,955 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-10-14 22:07:47,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:47,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:47,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:48,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:48,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,261 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-14 22:07:48,262 INFO L567 ElimStorePlain]: treesize reduction 14, result has 90.5 percent of original size [2019-10-14 22:07:48,266 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_42|, |v_#memory_int_30|], 2=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_39|]} [2019-10-14 22:07:48,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:07:48,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:07:48,374 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-10-14 22:07:48,413 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:07:48,446 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:07:48,476 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,498 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:135, output treesize:58 [2019-10-14 22:07:48,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-14 22:07:48,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:48,726 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-10-14 22:07:48,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,728 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_40|], 2=[|v_#memory_int_33|], 4=[|v_#memory_int_31|], 10=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2019-10-14 22:07:48,736 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:48,859 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-14 22:07:48,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,864 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:48,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:48,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:48,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-10-14 22:07:48,981 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-10-14 22:07:49,063 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,169 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 153 [2019-10-14 22:07:49,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,177 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,316 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-14 22:07:49,316 INFO L567 ElimStorePlain]: treesize reduction 466, result has 23.9 percent of original size [2019-10-14 22:07:49,344 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 122 [2019-10-14 22:07:49,346 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,410 INFO L567 ElimStorePlain]: treesize reduction 32, result has 74.0 percent of original size [2019-10-14 22:07:49,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,411 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:270, output treesize:106 [2019-10-14 22:07:49,518 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_39|, |v_#memory_$Pointer$.base_41|], 4=[|v_#memory_int_32|], 5=[|v_#memory_int_34|, |v_#memory_$Pointer$.base_44|, |v_#memory_$Pointer$.offset_42|]} [2019-10-14 22:07:49,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 22:07:49,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 22:07:49,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,623 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:49,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:49,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:49,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-10-14 22:07:49,673 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,731 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.2 percent of original size [2019-10-14 22:07:49,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 73 [2019-10-14 22:07:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:49,755 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:49,806 INFO L567 ElimStorePlain]: treesize reduction 40, result has 65.2 percent of original size [2019-10-14 22:07:49,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:49,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:49,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-14 22:07:49,812 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:49,827 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:171, output treesize:46 [2019-10-14 22:07:49,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:07:49,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:07:49,914 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:49,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-10-14 22:07:49,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:49,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-10-14 22:07:49,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,983 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-10-14 22:07:49,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:49,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-10-14 22:07:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:50,003 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:50,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-10-14 22:07:50,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769342199] [2019-10-14 22:07:50,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:07:50,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:50,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:07:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:07:50,005 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 18 states. [2019-10-14 22:07:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:51,639 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2019-10-14 22:07:51,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 22:07:51,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-10-14 22:07:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:51,641 INFO L225 Difference]: With dead ends: 118 [2019-10-14 22:07:51,642 INFO L226 Difference]: Without dead ends: 116 [2019-10-14 22:07:51,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2019-10-14 22:07:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-14 22:07:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2019-10-14 22:07:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-14 22:07:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2019-10-14 22:07:51,655 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 25 [2019-10-14 22:07:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:51,656 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2019-10-14 22:07:51,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 22:07:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2019-10-14 22:07:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 22:07:51,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:51,657 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:51,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:51,868 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1489624486, now seen corresponding path program 3 times [2019-10-14 22:07:51,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:51,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525212418] [2019-10-14 22:07:51,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:51,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:51,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:52,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525212418] [2019-10-14 22:07:52,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007209366] [2019-10-14 22:07:52,275 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:52,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 22:07:52,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:52,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 82 conjunts are in the unsatisfiable core [2019-10-14 22:07:52,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:52,489 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-10-14 22:07:52,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:52,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:07:52,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,731 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-14 22:07:52,731 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.0 percent of original size [2019-10-14 22:07:52,733 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_46|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-10-14 22:07:52,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:07:52,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:07:52,795 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:07:52,821 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:07:52,846 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:52,864 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:115, output treesize:49 [2019-10-14 22:07:52,964 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:52,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:07:52,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,227 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-10-14 22:07:53,228 INFO L567 ElimStorePlain]: treesize reduction 40, result has 83.7 percent of original size [2019-10-14 22:07:53,229 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_44|, |v_#memory_int_35|], 7=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_47|]} [2019-10-14 22:07:53,233 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:53,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,318 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:53,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-10-14 22:07:53,400 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 125 [2019-10-14 22:07:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:53,503 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,656 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-10-14 22:07:53,656 INFO L567 ElimStorePlain]: treesize reduction 322, result has 29.1 percent of original size [2019-10-14 22:07:53,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 67 [2019-10-14 22:07:53,663 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,694 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:200, output treesize:122 [2019-10-14 22:07:53,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:53,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-14 22:07:53,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:53,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,858 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|], 1=[|v_#memory_int_36|], 3=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_50|]} [2019-10-14 22:07:53,867 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:53,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:53,940 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:54,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2019-10-14 22:07:54,017 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,128 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-14 22:07:54,128 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.2 percent of original size [2019-10-14 22:07:54,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:54,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2019-10-14 22:07:54,139 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:54,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 134 [2019-10-14 22:07:54,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,252 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:54,364 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-10-14 22:07:54,364 INFO L567 ElimStorePlain]: treesize reduction 96, result has 51.3 percent of original size [2019-10-14 22:07:54,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:54,365 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:197, output treesize:145 [2019-10-14 22:07:54,965 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-14 22:07:54,966 INFO L341 Elim1Store]: treesize reduction 24, result has 82.9 percent of original size [2019-10-14 22:07:54,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 210 [2019-10-14 22:07:54,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:54,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,288 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:55,381 INFO L567 ElimStorePlain]: treesize reduction 137, result has 39.9 percent of original size [2019-10-14 22:07:55,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:55,419 INFO L341 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2019-10-14 22:07:55,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 56 [2019-10-14 22:07:55,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:55,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:222, output treesize:30 [2019-10-14 22:07:55,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 30 [2019-10-14 22:07:55,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:55,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:55,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:55,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-10-14 22:07:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:55,567 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:55,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-10-14 22:07:55,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676484530] [2019-10-14 22:07:55,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 22:07:55,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 22:07:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-10-14 22:07:55,572 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 23 states. [2019-10-14 22:07:56,682 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-10-14 22:07:57,162 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-10-14 22:07:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:59,005 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2019-10-14 22:07:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 22:07:59,005 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-10-14 22:07:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:59,007 INFO L225 Difference]: With dead ends: 137 [2019-10-14 22:07:59,007 INFO L226 Difference]: Without dead ends: 135 [2019-10-14 22:07:59,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2019-10-14 22:07:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-14 22:07:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 92. [2019-10-14 22:07:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-14 22:07:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2019-10-14 22:07:59,023 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 27 [2019-10-14 22:07:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:59,024 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2019-10-14 22:07:59,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 22:07:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2019-10-14 22:07:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 22:07:59,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:59,025 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:59,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:59,230 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1119694038, now seen corresponding path program 2 times [2019-10-14 22:07:59,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:59,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554108028] [2019-10-14 22:07:59,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:59,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:59,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:59,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554108028] [2019-10-14 22:07:59,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723320483] [2019-10-14 22:07:59,390 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:59,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:07:59,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:07:59,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-14 22:07:59,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:59,522 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-10-14 22:07:59,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 22:07:59,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,563 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-10-14 22:07:59,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,601 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:59,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,630 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:59,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:07:59,657 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:07:59,695 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,711 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:98, output treesize:41 [2019-10-14 22:07:59,798 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-14 22:07:59,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 43 [2019-10-14 22:07:59,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:07:59,802 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:07:59,825 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-10-14 22:07:59,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-10-14 22:07:59,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:7 [2019-10-14 22:07:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:59,873 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:07:59,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-14 22:07:59,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68682643] [2019-10-14 22:07:59,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 22:07:59,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:59,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 22:07:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:07:59,875 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 13 states. [2019-10-14 22:08:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:00,591 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2019-10-14 22:08:00,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:08:00,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-10-14 22:08:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:00,593 INFO L225 Difference]: With dead ends: 123 [2019-10-14 22:08:00,594 INFO L226 Difference]: Without dead ends: 93 [2019-10-14 22:08:00,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-10-14 22:08:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-14 22:08:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-10-14 22:08:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-14 22:08:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-10-14 22:08:00,624 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 28 [2019-10-14 22:08:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:00,626 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-10-14 22:08:00,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 22:08:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-10-14 22:08:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:08:00,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:00,627 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:00,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:00,832 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:00,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash -809428639, now seen corresponding path program 1 times [2019-10-14 22:08:00,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:00,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602497650] [2019-10-14 22:08:00,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:00,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:00,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:01,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602497650] [2019-10-14 22:08:01,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796143272] [2019-10-14 22:08:01,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:01,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-14 22:08:01,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:01,218 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-10-14 22:08:01,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-14 22:08:01,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,263 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-10-14 22:08:01,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,298 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_53|, |v_#memory_$Pointer$.base_55|], 2=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_53|]} [2019-10-14 22:08:01,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:08:01,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:08:01,345 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:08:01,367 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:08:01,383 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,394 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:103, output treesize:38 [2019-10-14 22:08:01,494 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_$Pointer$.offset_52|, |v_#memory_$Pointer$.base_54|], 10=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_54|]} [2019-10-14 22:08:01,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2019-10-14 22:08:01,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,548 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,586 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,761 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-14 22:08:01,761 INFO L341 Elim1Store]: treesize reduction 62, result has 70.0 percent of original size [2019-10-14 22:08:01,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 230 [2019-10-14 22:08:01,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:01,764 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,829 INFO L567 ElimStorePlain]: treesize reduction 112, result has 56.1 percent of original size [2019-10-14 22:08:01,883 INFO L341 Elim1Store]: treesize reduction 19, result has 77.6 percent of original size [2019-10-14 22:08:01,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 155 [2019-10-14 22:08:01,885 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,947 INFO L567 ElimStorePlain]: treesize reduction 16, result has 87.0 percent of original size [2019-10-14 22:08:01,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:01,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:01,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,949 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:220, output treesize:27 [2019-10-14 22:08:01,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-14 22:08:01,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:02,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-10-14 22:08:02,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-14 22:08:02,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:02,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:02,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:08:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:02,051 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:02,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-10-14 22:08:02,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826338563] [2019-10-14 22:08:02,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:08:02,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:08:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-10-14 22:08:02,053 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 18 states. [2019-10-14 22:08:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:03,086 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2019-10-14 22:08:03,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 22:08:03,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-14 22:08:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:03,088 INFO L225 Difference]: With dead ends: 130 [2019-10-14 22:08:03,088 INFO L226 Difference]: Without dead ends: 109 [2019-10-14 22:08:03,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-10-14 22:08:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-14 22:08:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2019-10-14 22:08:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 22:08:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-10-14 22:08:03,099 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 29 [2019-10-14 22:08:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:03,100 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-10-14 22:08:03,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 22:08:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2019-10-14 22:08:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:08:03,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:03,101 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:03,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:03,305 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:03,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash -467982571, now seen corresponding path program 4 times [2019-10-14 22:08:03,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:03,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644615636] [2019-10-14 22:08:03,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:03,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:03,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:03,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644615636] [2019-10-14 22:08:03,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300287366] [2019-10-14 22:08:03,793 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:03,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 22:08:03,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:03,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 99 conjunts are in the unsatisfiable core [2019-10-14 22:08:03,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:03,950 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-10-14 22:08:03,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 22:08:03,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:03,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:03,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-14 22:08:04,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:04,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 22:08:04,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:04,232 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-14 22:08:04,233 INFO L567 ElimStorePlain]: treesize reduction 14, result has 91.8 percent of original size [2019-10-14 22:08:04,236 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_59|, |v_#memory_$Pointer$.base_61|], 2=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_55|, |v_#memory_int_42|], 4=[|v_#memory_int_39|]} [2019-10-14 22:08:04,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:08:04,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:04,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:04,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-10-14 22:08:04,350 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:04,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:04,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:08:04,397 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:04,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:04,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:08:04,441 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:04,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:04,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:04,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 22:08:04,485 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:04,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:04,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:04,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-10-14 22:08:04,518 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:04,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:04,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:04,544 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:159, output treesize:67 [2019-10-14 22:08:04,697 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:04,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-14 22:08:04,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,191 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-10-14 22:08:05,192 INFO L567 ElimStorePlain]: treesize reduction 40, result has 86.9 percent of original size [2019-10-14 22:08:05,195 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_56|], 4=[|v_#memory_int_40|, |v_#memory_int_43|], 9=[|v_#memory_$Pointer$.offset_60|, |v_#memory_$Pointer$.base_62|]} [2019-10-14 22:08:05,201 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:05,389 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-14 22:08:05,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,394 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:05,584 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-14 22:08:05,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,589 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:05,768 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-14 22:08:05,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:05,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 47 [2019-10-14 22:08:05,785 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:05,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 41 [2019-10-14 22:08:05,892 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:05,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:05,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 111 [2019-10-14 22:08:06,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:06,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:06,003 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,120 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-10-14 22:08:06,120 INFO L567 ElimStorePlain]: treesize reduction 134, result has 51.1 percent of original size [2019-10-14 22:08:06,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:06,121 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:260, output treesize:110 [2019-10-14 22:08:06,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:06,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:06,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2019-10-14 22:08:06,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:07,053 WARN L191 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-10-14 22:08:07,053 INFO L567 ElimStorePlain]: treesize reduction 78, result has 82.8 percent of original size [2019-10-14 22:08:07,055 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_57|], 1=[|v_#memory_int_41|], 7=[|v_#memory_int_44|], 11=[|v_#memory_$Pointer$.base_63|, |v_#memory_$Pointer$.offset_61|]} [2019-10-14 22:08:07,065 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:07,320 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-14 22:08:07,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,324 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:07,559 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 22:08:07,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,564 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:07,765 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-14 22:08:07,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:07,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 67 [2019-10-14 22:08:07,786 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:07,924 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-14 22:08:07,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,054 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-14 22:08:08,055 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-10-14 22:08:08,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 277 treesize of output 211 [2019-10-14 22:08:08,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,086 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,428 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 74 [2019-10-14 22:08:08,429 INFO L567 ElimStorePlain]: treesize reduction 1329, result has 15.4 percent of original size [2019-10-14 22:08:08,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 155 [2019-10-14 22:08:08,440 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,510 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:358, output treesize:233 [2019-10-14 22:08:08,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 72 [2019-10-14 22:08:08,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,811 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 22:08:08,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,813 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_58|, |v_#memory_$Pointer$.base_60|], 6=[|v_#memory_$Pointer$.base_64|, |v_#memory_$Pointer$.offset_62|], 10=[|v_#memory_int_45|]} [2019-10-14 22:08:08,817 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,915 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 220 treesize of output 217 [2019-10-14 22:08:09,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:09,145 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:09,446 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2019-10-14 22:08:09,446 INFO L567 ElimStorePlain]: treesize reduction 148, result has 51.8 percent of original size [2019-10-14 22:08:09,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2019-10-14 22:08:09,465 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:09,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2019-10-14 22:08:09,551 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,667 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-14 22:08:09,668 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.3 percent of original size [2019-10-14 22:08:09,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,669 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:306, output treesize:261